Answer sets for propositional theories

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3662 LNAI, Issue , 2005, Pages 119-131

  Ferraris, Paolo ^a  

^a University of Texas at Austin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; MATHEMATICAL MODELS; PROBLEM SOLVING; SEMANTICS; SET THEORY;

EQUILIBRIUM LOGIC; KRIPKE MODELS; LOGIC PROGRAMS;

FORMAL LOGIC;

EID: 33646041309     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11546207_10     Document Type: Conference Paper

References (17)

1. [Cabalar and Ferraris, 2005] Pedro Cabalar and Paolo Ferraris. Propositional theories are equivalent to logic programs. In preparation, 2005.
2. [Calimeri et al., 2005] Francesco Calimeri, Wolfgang Faber, Nicola Leone, and Simona Perri. Declarative and computational properties of logic programs with aggregates. In Proc. IJCAI'05, 2005. To appear.
3. [Eiter and Gottlob, 1993] Thomas Eiter and Georg Gottlob. Complexity results for disjunctive logic programming and application to nonmonotonic logics. In Dale Miller, editor, Proceedings of International Logic Programming Symposium (ILPS), pages 266-278, 1993.
4. [Erdoǧan and Lifschitz, 2004] Selim T. Erdoǧan and Vladimir Lifschitz. Definitions in answer set programming. In Vladimir Lifschitz and Ilkka Niemelä, editors, Proceedings of 7th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR-7), pages 114-126, 2004.
5. [Faber et al., 2004] Wolfgang Faber, Nicola Leone, and Gerard Pfeifer. Recursive aggregates in disjunctive logic programs: Semantics and complexity. In Proc. 9th European Conference on Artificial Intelligence (JELIA '04), 2004. Revised version: http://www.wfaber.com/research/papers/jelia2004.pdf.
6. [Ferraris and Lifschitz, 2005] Paolo Ferraris and Vladimir Lifschitz. Weight constraints as nested expressions. Theory and Practice of Logic Programming, 5:45-74, 2005.
7. [Gelfond and Lifschitz, 1988] 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.
8. [Gelfond and Lifschitz, 1991] Michael Gelfond and Vladimir Lifschitz. Classical negation in logic programs and disjunctive databases. New Generation Computing, 9:365-385, 1991.
9. [Lifschitz and Turner, 1994] 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.
10. [Lifschitz et al., 1999] Vladimir Lifschitz, Lappoon R. Tang, and Hudson Turner. Nested expressions in logic programs. Annals of Mathematics and Artificial Intelligence, 25:369-389, 1999.
11. [Lifschitz et al., 2001] Vladimir Lifschitz, David Pearce, and Agustin Valverde. Strongly equivalent logic programs. ACM Transactions on Computational Logic, 2:526-541, 2001.
12. [Lifschitz, 1996] Vladimir Lifschitz. Foundations of logic programming. In Gerhard Brewka, editor, Principles of Knowledge Representation, pages 69-128. CSLI Publications, 1996.
13. [Osorio et al., 2004] Mauricio Osorio, Juan Antonio Navarro, and José Arrazola. Safe beliefs for propositional theories. Accepted to appear at Annals of Pure and Applied Logic, 2004.
14. [Pearce, 1997] David Pearce. A new logical characterization of stable models and answer sets. In Jürgen Dix, Luis Pereira, and Teodor Przymusinski, editors, NonMonotonic Extensions of Logic Programming (Lecture Notes in Artificial Intelligence 1216), pages 57-70. Springer-Verlag, 1997.
15. [Pearce, 1999] David Pearce. From here to there: Stable negation in logic programming. In D. Gabbay and H. Wansing, editors, What Is Negation? Kluwer, 1999.
16. [Simons et al., 2002] Patrik Simons, Ilkka Niemelä, and Timo Soininen. Extending and implementing the stable model semantics. Artificial Intelligence, 138:181-234, 2002.
17. [Turner, 2003] Hudson Turner. Strong equivalence made easy: nested expressions and weight constraints. Theory and Practice of Logic Programming, 3(4,5):609-622, 2003.