Stable models and circumscription

Artificial Intelligence

Volumn 175, Issue 1, 2011, Pages 236-263

  Ferraris, Paolo ^a   Lee, Joohyung ^b   Lifschitz, Vladimir ^c  

^a GOOGLE INC   (United States)

^b Arizona State University   (United States)

^c University of Texas at Austin   (United States)

Author keywords

Answer set programming; Circumscription; Nonmonotonic reasoning; Program completion; Stable models

Indexed keywords

LOGIC PROGRAMMING; SEMANTICS;

ANSWER SET PROGRAMMING; CIRCUMSCRIPTION; NON-MONOTONIC REASONING; PROGRAM COMPLETION; STABLE MODEL;

PROLOG (PROGRAMMING LANGUAGE);

EID: 70349869810     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.artint.2010.04.011     Document Type: Article

References (35)

1. Keith Clark Negation as failure Herve Gallaire, Jack Minker, Logic and Data Bases 1978 Plenum Press New York 293 322
2. Esra Erdem, and Vladimir Lifschitz Tight logic programs Theory and Practice of Logic Programming 3 2003 499 518
3. 1 in: Proceedings of European Conference on Logics in Artificial Intelligence (JELIA), 2004
4. François Fages Consistency of Clark's completion and existence of stable models Journal of Methods of Logic in Computer Science 1 1994 51 60
5. Paolo Ferraris, and Vladimir Lifschitz Mathematical foundations of answer set programming We Will Show Them! Essays in Honour of Dov Gabbay 2005 King's College Publications 615 664
6. Paolo Ferraris, Joohyung Lee, Vladimir Lifschitz, A new perspective on stable models, in: Proceedings of International Joint Conference on Artificial Intelligence (IJCAI), 2007, pp. 372-379.
7. Paolo Ferraris, Joohyung Lee, Vladimir Lifschitz, Ravi Palla, Symmetric splitting in the general theory of stable models, in: Proceedings of International Joint Conference on Artificial Intelligence (IJCAI), 2009, pp. 797-803.
8. Paolo Ferraris, Answer sets for propositional theories, in: Proceedings of International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR), 2005, pp. 119-131.
9. Michael Gelfond, and Vladimir Lifschitz The stable model semantics for logic programming Robert Kowalski, Kenneth Bowen, Proceedings of International Logic Programming Conference and Symposium 1988 MIT Press 1070 1080
10. Michael Gelfond, and Vladimir Lifschitz Classical negation in logic programs and disjunctive databases New Generation Computing 9 1991 365 385
11. Carla P. Gomes, Henry Kautz, Ashish Sabharwal, and Bart Selman Satisfiability solvers Frank van Harmelen, Vladimir Lifschitz, Bruce Porter, Handbook of Knowledge Representation 2008 Elsevier 89 134
12. Joohyung Lee, and Fangzhen Lin Loop formulas for circumscription Artificial Intelligence 170 2 2006 160 185
13. Joohyung Lee, Yunsong Meng, On loop formulas with variables, in: Proceedings of the International Conference on Knowledge Representation and Reasoning (KR), 2008, pp. 444-453.
14. Joohyung Lee, Vladimir Lifschitz, Ravi Palla, A reductive semantics for counting and choice in answer set programming, in: Proceedings of the AAAI Conference on Artificial Intelligence (AAAI), 2008, pp. 472-479.
15. Vladimir Lifschitz, David Pearce, and Agustin Valverde Strongly equivalent logic programs ACM Transactions on Computational Logic 2 2001 526 541
16. Vladimir Lifschitz, David Pearce, Agustin Valverde, A characterization of strong equivalence for logic programs with variables, in: Proceedings of International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR), 2007.
17. Vladimir Lifschitz, Computing circumscription, in: Proceedings of International Joint Conference on Artificial Intelligence (IJCAI), 1985, pp. 121-127.
18. Vladimir Lifschitz Pointwise circumscription Matthew Ginsberg, Readings in Nonmonotonic Reasoning 1987 Morgan Kaufmann San Mateo, CA 179 193
19. Vladimir Lifschitz, Twelve definitions of a stable model, in: Proceedings of International Conference on Logic Programming (ICLP), 2008, pp. 37-51.
20. Fangzhen Lin, and Raymond Reiter Rules as actions: A situation calculus semantics for logic programs Journal of Logic Programming 31 1997 299 330
21. Fangzhen Lin, and Shoham Yoav A logic of knowledge and justified assumptions Artificial Intelligence 57 1992 271 289
22. Fangzhen Lin, and Yuting Zhao ASSAT: Computing answer sets of a logic program by SAT solvers Proceedings of National Conference on Artificial Intelligence (AAAI) 2002 MIT Press 112 117
23. Fangzhen Lin, Yi Zhou, From answer set logic programming to circumscription via logic of GK, in: Proceedings of International Joint Conference on Artificial Intelligence (IJCAI), 2007.
24. Fangzhen Lin, A study of nonmonotonic reasoning, PhD thesis, Stanford University, 1991.
25. Victor Marek, and Mirosław Truszczyński Stable models and an alternative logic programming paradigm The Logic Programming Paradigm: A 25-Year Perspective 1999 Springer-Verlag 375 398
26. John McCarthy Circumscription-a form of non-monotonic reasoning Artificial Intelligence 13 1980 27 39 171-172
27. John McCarthy Applications of circumscription to formalizing common sense knowledge Artificial Intelligence 26 3 1986 89 116
28. Robert Moore Semantical considerations on nonmonotonic logic Artificial Intelligence 25 1 1985 75 94
29. Ilkka Niemelä Logic programs with stable model semantics as a constraint programming paradigm Annals of Mathematics and Artificial Intelligence 25 1999 241 273
30. Emilia Oikarinen, and Tomi Janhunen Achieving compositionality of the stable model semantics for Smodels programs Theory and Practice of Logic Programming 5-6 2008 717 761
31. David Pearce, Hans Tompits, Stefan Woltran, Encodings for equilibrium logic and logic programs with nested expressions, in: Proceedings of Portuguese Conference on Artificial Intelligence (EPIA), 2001, pp. 306-320.
32. David Pearce A new logical characterization of stable models and answer sets Jürgen Dix, Luis Pereira, Teodor Przymusinski, Non-Monotonic Extensions of Logic Programming Lecture Notes in Artificial Intelligence vol. 1216 1997 Springer-Verlag 57 70
33. Raymond Reiter A logic for default reasoning Artificial Intelligence 13 1980 81 132
34. Patrik Simons, Ilkka Niemelä, and Timo Soininen Extending and implementing the stable model semantics Artificial Intelligence 138 2002 181 234
35. Mark Wallace Tight, consistent and computable completions for unrestricted logic programs Journal of Logic Programming 15 1993 243 273