A reductive semantics for counting and choice in answer set programming

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2008, Pages 472-479

  Lee, Joohyung ^a   Lifschitz, Vladimir ^b   Palla, Ravi ^a  

^a Arizona State University   (United States)

^b University of Texas at Austin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; BIONICS; INFORMATION THEORY; LINGUISTICS; PROGRAM TRANSLATORS; SEMANTICS;

A STABLES; ANSWER SET PROGRAMMINGS; ANSWER SETS; CARDINALITY CONSTRAINTS; FIRST ORDERS; FOLLOW UP; SEMANTIC ROLES;

COMPUTER PROGRAMMING LANGUAGES;

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

References (12)

1. 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.
2. Paolo Ferraris and Vladimir Lifschitz. Weight constraints as nested expressions. Theory and Practice of Logic Programming, 5:45-74, 2005.
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. Paolo Ferraris. Answer sets for propositional theories. In Proceedings of International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR), pages 119-131, 2005.
5. 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. MIT Press, 1988.
6. Joohyung Lee and Ravi Palla. Yet another proof of the strong equivalence between propositional theories and logic programs. In Working Notes of the Workshop on Correspondence and Equivalence for Nonmonotonic Theories, 2007.
7. Nicola Leone, Wolfgang Faber, Gerald Pfeifer, Thomas Eiter, Georg Gottlob, Simona Perri, and Francesco Scar-cello. The DLV system for knowledge representation and reasoning. ACM Transactions on Computational Logic, 7(3):499-562, 2006.
8. Vladimir Lifschitz, David Pearce, and Agustin Valverde. A characterization of strong equivalence for logic programs with variables. In Procedings of International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR), 2007.
9. Vladimir Lifschitz. Computing circumscription. In Proceedings of International Joint Conference on Artificial Intelligence (IJCAI), pages 121-127, 1985.
10. John McCarthy. Circumscription-a form of non-mono-tonic reasoning. Artificial Intelligence, 13:27-39, 171-172, 1980.
11. Tommi Syrjänen. Cardinality constraint programs. In Proceedings of European Conference on Logics in Artificial Intelligence (JELIA), pages 187-199, 2004.
12. R. W. Topor and E. A. Sonenberg. On domain independent databases. In Jack Minker, editor, Foundations of Deductive Databases and Logic Programming, pages 217-240. Morgan Kaufmann, San Mateo, CA, 1988.