Sciweavers

47 search results - page 4 / 10
» Nonmonotonic Logics and Their Algebraic Foundations
Sort
View
LPNMR
2004
Springer
14 years 28 days ago
Simplifying Logic Programs Under Uniform and Strong Equivalence
Abstract. We consider the simplification of logic programs under the stablemodel semantics, with respect to the notions of strong and uniform equivalence between logic programs, r...
Thomas Eiter, Michael Fink, Hans Tompits, Stefan W...
LOGCOM
2008
97views more  LOGCOM 2008»
13 years 7 months ago
One-and-a-halfth-order Logic
The practice of first-order logic is replete with meta-level concepts. Most notably there are meta-variables ranging over formulae, variables, and terms, and properties of syntax s...
Murdoch James Gabbay, Aad Mathijssen
JOLLI
2002
109views more  JOLLI 2002»
13 years 7 months ago
Linear, Branching Time and Joint Closure Semantics for Temporal Logic
Temporal logic can be used to describe processes: their behaviour is characterized by a set of temporal models axiomatized by a temporal theory. Two types of models are most often ...
Joeri Engelfriet, Jan Treur
IJCAI
1989
13 years 8 months ago
Logic Programming with General Clauses and Defaults Based on Model Elimination
The foundations of a class of logic programming systems with the expressive power of full first-order logic and a non-monotonic component is addressed. The underlying refutation m...
Marco A. Casanova, Ramiro A. de T. Guerreiro, Andr...
CORR
2000
Springer
132views Education» more  CORR 2000»
13 years 7 months ago
Uniform semantic treatment of default and autoepistemic logics
We revisit the issue of epistemological and semantic foundations for autoepistemic and default logics, two leading formalisms in nonmonotonic reasoning. We develop a general seman...
Marc Denecker, Victor W. Marek, Miroslaw Truszczyn...