A characterization of strong equivalence for logic programs with variables

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

Volumn 4483 LNAI, Issue , 2007, Pages 188-200

  Lifschitz, Vladimir ^a   Pearce, David ^b   Valverde, Agustín ^c  

^a University of Texas at Austin   (United States)

^b UNIVERSIDAD REY JUAN CARLOS   (Spain)

^c UNIVERSITY OF MÁLAGA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINED OPTIMIZATION; PROBLEM SOLVING; SET THEORY;

GROUNDED PROGRAMS; NON-INTUITIONISTIC AXIOM SCHEMAS; PROPOSITIONAL LOGIC;

LOGIC PROGRAMMING;

EID: 38049092028     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72200-7_17     Document Type: Conference Paper

References (14)

1. Dirk van Dalen. Intuitionistic logic. In Dov Gabbay and Franz Guenther, editors, Handbook of Philosophical Logic, Volume III: Alternatives in Classical Logic, Dordrecht, 1986. D. Reidel Publishing Co.
2. Dick De Jongh and Lex Hendriks. Characterization of strongly equivalent logic programs in intermediate logics. Theory and Practice of Logic Programming, 3:250-270, 2003.
3. T. Eiter, M. Fink, H. Tompits, and S. Woltran Strong and Uniform Equivalence in Answer-Set Programming: Characterizations and Complexity Results for the Non-Ground Case. KR 2005, AAAI, 2005.
4. 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.
5. Paolo Ferraris. Answer sets for prepositional theories. In Proceedings of International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR), pages 119-131, 2005.
6. 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. n of gödel. Journal of the Faculty of Science of the University of Tokyo, 13:183-187, 1996.
8. Vladimir Lifschitz, David Pearce, and Agustin Valverde. Strongly equivalent logic programs. ACM Transactions on Computational Logic, 2:526-541, 2001.
9. F. Lin. Reducing Strong Equivalence of Logic Programs to Entailment in Classical Propositional Logic. In Proc. KR'02, 170-176.
10. 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.
11. David Pearce and Agustin Valverde. A first order nonmonotonic extension of constructive logic. Studia Logica, 80:323-348, 2005.
12. David Pearce and Agustin Valverde. Quantified Equilibrium Logic and the First Order Logic of Here-and-There. Technical Report, Univ. Rey Juan Carlos, 2006, available at http://www.satd.uma.es/matap/investig/tr/ma06_02.pdf.
13. David Pearce. A new logical characterization of stable models and answer sets. In Jürgen Dix, Luis Pereira, and Teodor Przymusinski, editors, Non-Monotonie Extensions of Logic Programming (Lecture Notes in Artificial Intelligence 1216), pages 57-70. Springer-Verlag, 1997.
14. Patrik Simons, Ilkka Niemelä, and Timo Soininen. Extending and implementing the stable model semantics. Artificial Intelligence, 138:181-234, 2002.