Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/springer-journals/a-generalization-of-the-lin-zhao-theorem-6sjAapLfLP
References (35)
-
F. Fages (1992)
Consistency of Clark's completion and existence of stable modelsMethods Log. Comput. Sci., 1
-
V. Lifschitz, A. Razborov (2006)
Why are there so many loop formulas?ACM Trans. Comput. Log., 7
-
Fangzhen Lin, Yuting Zhao (2002)
ASSAT: computing answer sets of a logic program by SAT solvers -
M. Gelfond, V. Lifschitz (1988)
Proceedings of International Logic Programming Conference and Symposium -
N. Leone, P. Rullo, Francesco Scarcello (1997)
Disjunctive Stable Models: Unfounded Sets, Fixpoint Semantics, and ComputationInf. Comput., 135
-
D. Saccá, C. Zaniolo (1990)
Stable models and non-determinism in logic programs with negation -
Y. Lierler (2005)
cmodels - SAT-Based Disjunctive Answer Set Solver -
(1990)
In Proceedings of ACM Symposium on Principles of Database Systems (PODS) -
H. Gallaire, J. Minker (1978)
Logic and Data Bases -
E. Erdem, V. Lifschitz (2003)
Under Consideration for Publication in Theory and Practice of Logic Programming Tight Logic Programs -
Dan Suciu, V. Vianu (2006)
IntroductionJ. ACM, 53
-
M. Golumbic (2002)
Annals of Mathematics and Artificial IntelligenceAnnals of Mathematics and Artificial Intelligence, 36
-
P. Ferraris, V. Lifschitz (2005)
We Will Show Them! Essays in Honour of Dov Gabbay, vol. 1 -
A. Gelder, K. Ross, J. Schlipf (1991)
The well-founded semantics for general logic programsJ. ACM, 38
-
J. McCarthy, V. Lifschitz (1998)
Formalizing Common Sense: Papers by John McCarthy -
(2001)
In Proceedings of Portuguese Conference on Artificial Intelligence (EPIA) -
Joohyung Lee (2005)
A Model-Theoretic Counterpart of Loop Formulas -
Sergei Artëmov, H. Barringer, A. Garcez, L. Lamb, John Woods (2005)
We Will Show Them! Essays in Honour of Dov Gabbay, Volume One -
(1994)
The Handbook of Logic in AI and Logic Programming -
J. McCarthy (1987)
Applications of Circumscription to Formalizing Common Sense KnowledgeArtif. Intell., 28
-
V. Lifschitz, Lappoon Tang, H. Turner (1999)
Nested expressions in logic programsAnnals of Mathematics and Artificial Intelligence, 25
-
D. Pearce (1996)
A New Logical Characterisation of Stable Models and Answer Sets -
(1997)
editors -
(2005)
In Proceedings of International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR) -
J. McCarthy (1995)
Circumscription: a form of non-monotonic reasoning -
D. Pearce (1997)
Non-Monotonic Extensions of Logic Programming (Lecture Notes in Artificial Intelligence 1216) -
P. Ferraris (2005)
Answer Sets for Propositional Theories -
Joohyung Lee, V. Lifschitz (2003)
Loop Formulas for Disjunctive Logic Programs -
A. Troelstra, H. Schwichtenberg (1996)
Basic proof theory, 43
-
E. Erdem, V. Lifschitz (2003)
Tight logic programsTheory and Pract. Log. Prog., 3
-
P. Ferraris, V. Lifschitz (2005)
Mathematical Foundations of Answer Set Programming -
D. Pearce, H. Tompits, S. Woltran (2001)
Encodings for Equilibrium Logic and Logic Programs with Nested Expressions -
Keith Clark (1987)
Negation as Failure -
M. Gelfond, V. Lifschitz (1990)
Logic Programs with Classical Negation -
J. McCarthy (1980)
Addendum: Circumscription and other Non-Monotonic FormalismsArtif. Intell., 13
- Publisher
- Springer Journals
- Copyright
- Copyright © 2006 by Springer Science+Business Media, Inc.
- Subject
- Computer Science; Complexity; Computer Science, general ; Mathematics, general; Artificial Intelligence (incl. Robotics)
- ISSN
- 1012-2443
- eISSN
- 1573-7470
- DOI
- 10.1007/s10472-006-9025-2
- Publisher site
- See Article on Publisher Site
Abstract
The theorem on loop formulas due to Fangzhen Lin and Yuting Zhao shows how to turn a logic program into a propositional formula that describes the program’s stable models. In this paper we simplify and generalize the statement of this theorem. The simplification is achieved by modifying the definition of a loop in such a way that a program is turned into the corresponding propositional formula by adding loop formulas directly to the conjunction of its rules, without the intermediate step of forming the program’s completion. The generalization makes the idea of a loop formula applicable to stable models in the sense of a very general definition that covers disjunctive programs, programs with nested expressions, and more.
Journal
Annals of Mathematics and Artificial Intelligence – Springer Journals
Published: Sep 20, 2006