On modular translations and strong equivalence

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

Volumn 3662 LNAI, Issue , 2005, Pages 79-91

  Ferraris, Paolo ^a  

^a University of Texas at Austin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; SEMANTICS; TRANSLATION (LANGUAGES);

CARDINALITY CONSTRAINTS; MODULAR TRANSLATIONS; MONOTONE CARDINALITY ATOMS;

FORMAL LOGIC;

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

References (18)

1. [Cabalar and Ferraris, 2005] Pedro Cabalar and Paolo Ferraris. Propositional theories are equivalent to logic programs. In preparation, 2005.
2. [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.
3. [Erdem and Lifschitz, 2003] Esra Erdem and Vladimir Lifschitz. Tight logic programs. Theory and Practice of Logic Programming, 3:499-518, 2003.
4. [Ferraris and Lifschitz, 2005] Paolo Ferraris and Vladimir Lifschitz. Weight constraints as nested expressions. Theory and Practice of Logic Programming, 5:45-74, 2005.
5. [Ferraris, 2005] Paolo Ferraris. A modular, polynomial method for eliminating weight constraints. 2 Unpublished draft, 2005.
6. [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.
7. [Janhunen, 2000] Tomi Janhunen. Comparing the expressive powers of some syntactically restricted classes of logic programs. In Proc. 1st International Conference on Computational Logic, volume 1861, pages 852-866, 2000.
8. [Lee, 2005] Joohyung Lee. A model-theoretic counterpart of loop formulas. In Proc. IJCAI, 2005. To appear.
9. [Lifschitz and Woo, 1992] Vladimir Lifschitz and Thomas Woo. Answer sets in general nonmonotonic reasoning (preliminary report). In Bernhard Nebel, Charles Rich, and William Swartout, editors, Proc. Third Int'l Conf. on Principles of Knowledge Representation and Reasoning, pages 603-614, 1992.
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. [Lin and Chen, 2005] Fangzhen Lin and Yin Chen. Discovering classes of strongly equivalent logic programs. In Proc. IJCAI, 2005. To appear.
13. [Marek and Niemelä, 2004] Victor Marek and Ilkka Niemelä. On logic programs with cardinality constraints. In Proc. 7th Int'l Conference on Logic Programming and Nonmonotonic Reasoning, pages 154-166, 2004.
14. [Marek and Truszczyński, 1991] Victor Marek and Mirosław Truszczyński. Autoepistemic logic. Journal of the ACM, 38:588-619, 1991.
15. [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.
16. [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.
17. [Simons et al., 2002] Patrik Simons, Ilkka Niemelä, and Timo Soininen. Extending and implementing the stable model semantics. Artificial Intelligence, 138:181-234, 2002.
18. [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.