Yet another proof of the strong equivalence between propositional theories and logic programs

CEUR Workshop Proceedings

Volumn 265, Issue , 2007, Pages 1-12

  Lee, Joohyung ^a   Palla, Ravi ^a  

^a ARIZONA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CLASSICAL LOGIC; FIRST-ORDER FORMULAS; LOGIC PROGRAMS; PRENEX NORMAL FORMS; PROPOSITIONAL FORMULAS; PROPOSITIONAL THEORIES; PROTOTYPE IMPLEMENTATIONS; STABLE MODEL SEMANTICS;

SEMANTICS;

LOGIC PROGRAMMING;

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

References (18)

1. Pearce, D.: A new logical characterization of stable models and answer sets. In Dix, J., Pereira, L., Przymusinski, T., eds.: Non-Monotonic Extensions of Logic Programming (Lecture Notes in Artificial Intelligence 1216), Springer-Verlag (1997) 57-70
2. Ferraris, P.: Answer sets for propositional theories. In: Proceedings of International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR). (2005) 119-131
3. Cabalar, P., Ferraris, P.: Propositional theories are strongly equivalent to logic programs. Submitted for publication (2005)
4. Lifschitz, V., Pearce, D., Valverde, A.n.: Strongly equivalent logic programs. ACM Transactions on Computational Logic 2 (2001) 526-541
5. Cabalar, P., Pearce, D., Valverde, A.n.: Reducing propositional theoreis in equilibrium logic to logic programs. In: Proceedings of 12th Portuguese Conference on Artificial Intelligence (EPIA 2005). (2005) 4-17
6. Lifschitz, V., Tang, L.R., Turner, H.: Nested expressions in logic programs. Annals of Mathematics and Artificial Intelligence 25 (1999) 369-389
7. Sarsakov, V., Schaub, T., Tompits, H., Woltran, S.: nlp: A compiler for nested logic programming. In Lifschitz, V., Niemelä, I., eds.: Proceedings of the Seventh International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'04). Volume 2923 of Lecture Notes in Computer Science., Springer-Verlag Heidelberg (2003) 361-364
8. Ferraris, P., Lee, J., Lifschitz, V.: A new perspective on stable models. In: Proceedings of International Joint Conference on Artificial Intelligence (IJCAI). (2007)
9. Pearce, D., Tompits, H., Woltran, S.: Encodings for equilibrium logic and logic programs with nested expressions. In: Proceedings of Portuguese Conference on Artificial Intelligence (EPIA). (2001) 306-320
10. McCarthy, J.: Circumscription - A form of non-monotonic reasoning. Artificial Intelligence 13 (1980) 27-39, 171-172
11. Lifschitz, V.: Circumscription. In Gabbay, D., Hogger, C., Robinson, J., eds.: The Handbook of Logic in AI and Logic Programming. Volume 3. Oxford University Press (1994) 298-352
12. Ferraris, P., Lifschitz, V.: Mathematical foundations of answer set programming. In: We Will Show Them! Essays in Honour of Dov Gabbay. King's College Publications (2005) 615-664
13. Lin, F.: Reducing strong equivalence of logic programs to entailment in classical propositional logic. In: Proceedings of International Conference on Principles of Knowledge Representation and Reasoning (KR). (2002) 170-176
14. Pearce, D., n Valverde, A.: A first order nonmonotonic extension of constructive logic. Studia Logica 80 (2005) 323-348
15. Mendelson, E.: Introduction to Mathematical Logic. Wadsworth & Brooks (1987) Third edition.
16. Texas Action Group: Technical discussions: Do we need existential quantifiers in logic programming? (2007) http://www.cs.utexas.edu/users/vl/tag/ discussions.html.
17. Janhunen, T.: On the effect of default negation on the expressiveness of disjunctive rules. In: Proc. LPNMR 2001. (2001) 93-106
18. Cabalar, P., Pearce, D., Valverde, A.N.: Minimal logic programs. Unpublished draft (2007)