A new perspective on stable models

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2007, Pages 372-379

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

^a University of Texas at Austin   (United States)

^b Arizona State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ANSWER SET PROGRAMMING; DECLARATIVE SEMANTICS; LOGIC PROGRAMS; NEGATION AS FAILURES; PROLOG PROGRAMS; SECOND-ORDER LOGIC; STABLE MODEL; SYNTACTIC TRANSFORMATIONS;

ARTIFICIAL INTELLIGENCE; LOGIC PROGRAMMING; SEMANTICS;

PROLOG (PROGRAMMING LANGUAGE);

EID: 84880867448     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (36)

1. Keith Clark. Negation as failure. In Herve Gallaire and Jack Minker, editors, Logic and Data Bases, pages 293-322. Plenum Press, New York, 1978.
2. Patrick Doherty,Witold Łukaszewicz, and Andrzey Szałas. Computing circumscription revisited: A reduction algorithm. Journal of Automated Reasoning, 18(3):297-336, 1997.
3. Thomas Eiter, Michael Fink, Hans Tompits, Patrick Traxler, and Stefan Woltran. Replacements in non-ground answer-set programming. In Proceedings of International Conference on Principles of Knowledge Representation and Reasoning (KR), 2006.
4. Esra Erdem and Vladimir Lifschitz. Tight logic programs. Theory and Practice of Logic Programming, 3:499-518, 2003.
5. Wolfgang Faber, Nicola Leone, and Gerard Pfeifer. Recursive aggregates in disjunctive logic programs: Semantics and complexity. In Proceedings of European Conference on Logics in Artificial Intelligence (JELIA), 2004. Revised version: http://www.wfaber.com/research/papers/jelia2004.pdf.
6. François Fages. A fixpoint semantics for general logic programs compared with the well-supported and stable model semantics. New Generation Computing, 9:425-443, 1991.
7. Paolo Ferraris and Vladimir Lifschitz. Mathematical foundations of answer set programming. In We Will Show Them! Essays in Honour of Dov Gabbay, pages 615-664. King's College Publications, 2005.
8. Paolo Ferraris and Vladimir Lifschitz. Weight constraints as nested expressions. Theory and Practice of Logic Programming, 5:45-74, 2005.
9. Paolo Ferraris, Joohyung Lee, and Vladimir Lifschitz. A generalization of the Lin-Zhao theorem. Annals of Mathematics and Artificial Intelligence, 2006. To appear.
10. Paolo Ferraris. Answer sets for propositional theories. In Proceedings of International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR), pages 119-131, 2005.
11. Michael Gelfond and Vladimir Lifschitz. The stable model semantics for logic programming. In Robert Kowalski and Kenneth Bowen, editors, Proceedings of International Logic Programming Conference and Symposium, pages 1070-1080, 1988.
12. Michael Gelfond and Vladimir Lifschitz. Classical negation in logic programs and disjunctive databases. New Generation Computing, 9:365-385, 1991.
13. Michael Gelfond. On stratified autoepistemic theories. In Proceedings of National Conference on Artificial Intelligence (AAAI), pages 207-211, 1987.
14. Michael Gelfond. Representing knowledge in A-Prolog. Lecture Notes in Computer Science, 2408:413-451, 2002.
15. Joohyung Lee and Fangzhen Lin. Loop formulas for circumscription. Artificial Intelligence, 170(2):160-185, 2006.
16. Vladimir Lifschitz, David Pearce, and Agustin Valverde. Strongly equivalent logic programs. ACM Transactions on Computational Logic, 2:526-541, 2001.
17. Vladimir Lifschitz. Computing circumscription. In Proceedings of International Joint Conference on Artificial Intelligence (IJCAI), pages 121-127, 1985.
18. Vladimir Lifschitz. Pointwise circumscription. In Matthew Ginsberg, editor, Readings in nonmonotonic reasoning, pages 179-193. Morgan Kaufmann, San Mateo, CA, 1987.
19. Vladimir Lifschitz. On open defaults. In John Lloyd, editor, Computational Logic: Symposium Proceedings, pages 80-95. Springer, 1990.
20. Vladimir Lifschitz. Circumscription. In D.M. Gabbay, C.J. Hogger, and J.A. Robinson, editors, The Handbook of Logic in AI and Logic Programming, volume 3, pages 298-352. Oxford University Press, 1994.
21. Vladimir Lifschitz. On the logic of causal explanation. Artificial Intelligence, 96:451-465, 1997.
22. Fangzhen Lin and Yi Zhou. From answer set logic programming to circumscription via logic of GK. In Proceedings of International Joint Conference on Artificial Intelligence (IJCAI), 2007. This volume.
23. Fangzhen Lin. A Study of Nonmonotonic Reasoning. PhD thesis, Stanford University, 1991.
24. Fangzhen Lin. Reducing strong equivalence of logic programs to entailment in classical propositional logic. In Proceedings of International Conference on Principles of Knowledge Representation and Reasoning (KR), pages 170-176, 2002.
25. John Lloyd. Foundations of Logic Programming. Springer-Verlag, 1984.
26. Norman McCain and Hudson Turner. Causal theories of action and change. In Proceedings of National Conference on Artificial Intelligence (AAAI), pages 460-465, 1997.
27. John McCarthy. Circumscription - a form of non-monotonic reasoning. Artificial Intelligence, 13:27-39,171-172, 1980.
28. John McCarthy. Applications of circumscription to formalizing common sense knowledge. Artificial Intelligence, 26(3):89-116, 1986. (Pubitemid 16503926)
29. Robert Moore. Semantical considerations on nonmonotonic logic. Artificial Intelligence, 25(1):75-94, 1985.
30. David Pearce and Agustin Valverde. Towards a first order equilibrium logic for nonmonotonic reasoning. In Proceedings of European Conference on Logics in Artificial Intelligence (JELIA), pages 147-160, 2004.
31. David Pearce and Agustin Valverde. A first order nonmonotonic extension of constructive logic. Studia Logica, 80:323-348, 2005.
32. David Pearce, Hans Tompits, and Stefan Woltran. Encodings for equilibrium logic and logic programs with nested expressions. In Proceedings of Portuguese Conference on Artificial Intelligence (EPIA), pages 306-320, 2001.
33. David Pearce. A new logical characterization of stable models and answer sets. In Jürgen Dix, Luis Pereira, and Teodor Przymusinski, editors, Non-Monotonic Extensions of Logic Programming (Lecture Notes in Artificial Intelligence 1216), pages 57-70. Springer-Verlag, 1997.
34. Raymond Reiter. A logic for default reasoning. Artificial Intelligence, 13:81-132, 1980.
35. Raymond Reiter. Circumscription implies predicate completion (sometimes). In Proceedings of International Joint Conference on Artificial Intelligence (IJCAI), pages 418-420, 1982.
36. Patrik Simons, Ilkka Niemelä, and Timo Soininen. Extending and implementing the stable model semantics. Artificial Intelligence, 138:181-234, 2002.