Symmetric splitting in the general theory of stable models

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2009, Pages 797-803

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

^a GOOGLE INC   (United States)

^b Arizona State University   (United States)

^c University of Texas at Austin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTER CIRCUITS;

FIRST-ORDER; GENERAL THEORY; LOGIC PROGRAMS; STABLE MODEL; SYMMETRIC SPLITTING;

LOGIC PROGRAMMING;

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

References (18)

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. Paolo Ferraris, Joohyung Lee, and Vladimir Lifschitz. A generalization of the Lin-Zhao theorem. Annals of Mathematics and Artificial Intelligence, 47:79-101, 2006.
3. Paolo Ferraris, Joohyung Lee, and Vladimir Lifschitz. A new perspective on stable models. In Proceedings of International Joint Conference on Artificial Intelligence (IJCAI), pages 372-379, 2007.
4. 5 Artificial Intelligence, 2010. To appear.
5. Tomi Janhunen, Emilia Oikarinen, Hans Tompits, and Stefan Woltran. Modularity aspects of disjunctive stable models. In Procedings of International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR), pages 175-187, 2007.
6. Tae-Won Kim, Joohyung Lee, and Ravi Palla. Circumscriptive event calculus as answer set programming. 2009. This volume.
7. Joohyung Lee and Vladimir Lifschitz. Loop formulas for disjunctive logic programs. In Proceedings of International Conference on Logic Programming (ICLP), pages 451-465, 2003.
8. Joohyung Lee and Yunsong Meng. On loop formulas with variables. In Proceedings of the International Conference on Knowledge Representation and Reasoning (KR), pages 444-453, 2008.
9. Joohyung Lee, Vladimir Lifschitz, and Ravi Palla. A reductive semantics for counting and choice in answer set programming. In Proceedings of the AAAI Conference on Artificial Intelligence (AAAI), pages 472- 479, 2008.
10. Vladimir Lifschitz and Hudson Turner. Splitting a logic program. In Pascal Van Hentenryck, editor, Proceedings of International Conference on Logic Programming (ICLP), pages 23-37, 1994.
11. Vladimir Lifschitz. What is answer set programming? In Proceedings of the AAAI Conference on Artificial Intelligence, pages 1594-1597, 2008.
12. Fangzhen Lin and Yuting Zhao. ASSAT: Computing answer sets of a logic program by SAT solvers. Artificial Intelligence, 157:115-137, 2004.
13. Victor Marek and Mirosław Truszczyński. Stable models and an alternative logic programming paradigm. In The Logic Programming Paradigm: a 25-Year Perspective, pages 375-398. Springer Verlag, 1999.
14. Ilkka Niemelä. Logic programs with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence, 25:241-273, 1999.
15. Emilia Oikarinen and Tomi Janhunen. Achieving compositionality of the stable model semantics for Smodels programs. Theory and Practice of Logic Programming, 5-6:717-761, 2008.
16. Murray Shanahan. Solving the Frame Problem: A Mathematical Investigation of the Common Sense Law of Inertia. MIT Press, 1997.
17. Patrik Simons, Ilkka Niemelä, and Timo Soininen. Extending and implementing the stable model semantics. Artificial Intelligence, 138:181-234, 2002.
18. Tommi Syrjänen. Cardinality constraint programs. In Proceedings of European Conference on Logics in Artificial Intelligence (JELIA), pages 187-199, 2004.