206 search results - page 15 / 42 » Semantics, modularity, and rewriting logic |
112
Voted
LOPSTR
2007
Springer
15 years 6 months ago
2007
Springer
This paper introduces a modular framework for termination analysis of logic programming. To this end, we adapt the notions of dependency pairs and dependency graphs (which were dev...
112
Voted
LOPSTR
2009
Springer
15 years 7 months ago
2009
Springer
We show how to combine the two most powerful approaches for automated termination analysis of logic programs (LPs): the direct approach which operates directly on LPs and the trans...
98
Voted
JURIX
2007
15 years 2 months ago
2007
Abstract. In this paper, we present a new ontology-based formalism for representing patent information. The framework defines concepts and relations for the major aspects of paten...
114
Voted
CSL
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Probably the most significant result concerning cut-free sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a n...
123
click to vote
ENTCS
2006
15 years 19 days ago
2006
This paper has the purpose of reviewing some of the established relationships between logic and concurrency, and of exploring new ones. Concurrent and distributed systems are noto...