Reducing propositional theories in equilibrium logic to logic programs

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

Volumn 3808 LNCS, Issue , 2005, Pages 4-17

  Cabalar, Pedro ^a   Pearce, David ^b   Valverde, Agustín ^c  

^a UNIVERSITY OF A CORUÑA   (Spain)

^b UNIVERSIDAD REY JUAN CARLOS   (Spain)

^c UNIVERSITY OF MÁLAGA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; INFORMATION TECHNOLOGY; MATHEMATICAL TRANSFORMATIONS; POLYNOMIAL APPROXIMATION; SEMANTICS; SET THEORY; THEOREM PROVING;

INITIAL THEORY; LOGIC TO LOGIC PROGRAMS; POLYNOMIAL TIME TRANSFORMATION; PROPOSITIONAL THEORIES;

LOGIC PROGRAMMING;

EID: 33744785093     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11595014_2     Document Type: Conference Paper

References (24)

1. P. Cabalar & P. Ferraris. Prepositional Theories are Strongly Equivalent to Logic Programs. Unpublished draft, 2005, available at http://www.dc.fi.udc.es/~cabalar/pt21p.pdf.
2. D. van Dalen. Intuitionistic logic. In Handbook of Philosophical Logic, Volume III: Alternatives in Classical Logic, Kluwer, Dordrecht, 1986.
3. P. M. Dung. Declarative Semantics of Hypothetical Logic Programing with Negation as Failure, in Proceedings ELP 92, 1992, 99. 45-58.
4. W. Faber, N. Leone & G. Pfeifer. Recursive Aggregates in Disjunctive Logic Programs: semantics and Complexity, in J.J. Alferes & J. Leite (eds), Logics In Artificial Intelligence. Proceedings JELIA'04, Springer LNAI 3229, 2004, pp. 200-212.
5. P. Ferraris. Answer Sets for Propositional Theories. In Eighth Intl. Conf. on Logic Programming and Nonmonotonic Reasoning (LPNMR'05), 2005 (to appear).
6. P. Ferraris & V. Lifschitz. Weight Constraints as Nested Expressions. Theory and Practice of Logic Programming (to appear).
7. M. Gelfond & V. Lifschitz. Classical negation in logic programs and disjunctive databases. New Generation Computing, 9:365-385, 1991.
8. L. Giordano & N. Olivetti. Combining Negation-as-Failure and Embedded Implications in Logic Programs. Journal of Logic Programming 36 (1998), 91-147.
9. R. Hähnle. Complexity of Many-Valued Logics. In Proc. 31st International Symposium on Multiple-Valued Logics, IEEE CS Press, Los Alamitos (2001) 137-146.
10. T. Janhunen, I. Niemelä, P. Simons & J.-H. You. Unfolding Partiality and Disjunctions in Stable Model Semantics. In A. G. Cohn, F. Giunchiglia & B. Selman (eds), Principles of Knowledge Representation and Reasoning (KR-00), pages 411424. Morgan Kaufmann, 2000.
11. N. Leone, G. Pfeifer, W. Faber, T. Eiter, G. Gottlob, S. Perri & F. Scarcello. The dlv System for Knowledge Representation and Reasoning. CoRR: cs.AI/0211004, September 2003.
12. V. Lifschitz, L. R. Tang & H. Turner. Nested Expressions in Logic Programs. Annals of Mathematics and Artificial Intelligence, 25 (1999), 369-389.
13. V. Lifschitz, D. Pearce & A. Valverde. Strongly Equivalent Logic Programs. ACM Transactions on Computational Logic, 2(4):526-541, 2001.
14. G. Mints. Resolution Strategies for the Intuitionistic Logic. In B. Mayoh, E. Tyugu & J. Penjaam (eds), Constraint Programming NATO ASI Series, Springer, 1994, pp.282-304.
15. M. Osorio, J. A. Navarro Pérez & J. Arrazola Safe Beliefs for Propositional Theories Ann. Pure & Applied Logic (in press).
16. D. Pearce, V. Sarsakov, T. Schaub, H. Tompits & S. Woltran. Polynomial Translations of Nested Logic Programs into Disjunctive Logic Programs. In Proc. of the 19th Int. Conf. on Logic Programming (ICLP'02), 405-420, 2002.
17. D. Pearce. A New Logical Characterisation of Stable Models and Answer Sets. In Non-Monotonic Extensions of Logic Programming, NMELP 96, LNCS 1216, pages 57-70. Springer, 1997.
18. D. Pearce. From Here to There: stable negation in logic programming. In D. Gabbay & H. Wansing, eds., What is Negation?, pp. 161-181. Kluwer Academic Pub., 1999.
19. D. Pearce, I. P. de Guzmán & A. Valverde. A Tableau Calculus for Equilibrium Entailment. In Automated Reasoning with Analytic Tableaux and Related Methods, TABLEAUX 2000, LNAI 1847, pages 352-367. Springer, 2000.
20. D. Pearce, I.P. de Guzmán & A. Valverde. Computing Equilibrium Models using Signed Formulas. In Proc. of CL2000, LNCS 1861, pp. 688-703. Springer, 2000.
21. D. Pearce & A. Valverde. Synonymous Theories in Answer Set Programming and Equilibrium Logic, in R. López de Mántaras & L. Saitta (eds), Proceedings ECAI 04, IOS Press, 2004, pp. 388-392.
22. V. Sarsakov, T. Schaub, H. Tompits & S. Woltran. nip: A Compiler for Nested Logic Programming, in Proceedings of LPNMR 2004, PP. 361-364. Springer LNAI 2923, 2004.
23. D. Seipel. Using Clausal Deductive Databases for Defining Semantics in Disjunctive Deductive Databases. Annals of Mathematics and Artificial Intelligence 33 (2001), pp. 347-378.
24. P. Simons, I. Niemelä & T. Soininen. Extending and implementing the stable model semantics. Artificial Intelligence, 138(1-2):181-234, 2002.