Sciweavers

3931 search results - page 170 / 787
» Separation logic and abstraction
Sort
View
AGP
1994
IEEE
15 years 10 months ago
A Compositional Semantics for Conditional Term Rewriting Systems
This paper considers compositions of conditional term rewriting systems as a basis for a modular approach to the design and analysis of equational logic programs. In this context,...
María Alpuente, Moreno Falaschi, Marí...
AAECC
2010
Springer
114views Algorithms» more  AAECC 2010»
15 years 6 months ago
Termination of narrowing via termination of rewriting
Abstract Narrowing extends rewriting with logic capabilities by allowing logic variables in terms and by replacing matching with unification. Narrowing has been widely used in diff...
Naoki Nishida, Germán Vidal
RR
2009
Springer
16 years 1 months ago
Paraconsistent Reasoning for OWL 2
Abstract. A four-valued description logic has been proposed to reason with description logic based inconsistent knowledge bases. This approach has a distinct advantage that it can ...
Yue Ma, Pascal Hitzler
CSL
2004
Springer
15 years 12 months ago
Game-Based Notions of Locality Over Finite Models
Locality notions in logic say that the truth value of a formula can be determined locally, by looking at the isomorphism type of a small neighborhood of its free variables. Such n...
Marcelo Arenas, Pablo Barceló, Leonid Libki...
ECAI
1992
Springer
15 years 10 months ago
On the Impact of Stratification on the Complexity of Nonmonotonic Reasoning
ABSTRACT. This paper investigates the problem of finding subclasses of nonmonotonic reasoning which can be implemented efficiently. The ability to "define" propositions u...
Ilkka Niemelä, Jussi Rintanen