Simplifying logic programs under uniform and strong equivalence

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 2923, Issue , 2004, Pages 87-99

  Eiter, Thomas ^a   Fink, Michael ^a   Tompits, Hans ^a   Woltran, Stefan ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; SEMANTICS; COMPUTATIONAL COMPLEXITY; DATABASE SYSTEMS; MATHEMATICAL TRANSFORMATIONS; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING;

ANSWER SET PROGRAMMING; LOGIC PROGRAMS; NONMONOTONIC LOGIC PROGRAMS; OPTIMIZING PROGRAMS; PROGRAM SIMPLIFICATION; PROGRAM TRANSFORMATIONS; SEMANTIC FOUNDATION; SEMANTIC RULES;

LOGIC PROGRAMMING;

ANSWER SET PROGRAMMING; ANSWER SET SOLVERS; LOGIC PROGRAMS;

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

References (24)

1. R. Ben-Eliyahu and R. Dechter. Propositional Semantics for Disjunctive Logic Programs. Annals of Mathematics and Artificial Intelligence, 12:53-87, 1994.
2. S. Brass and J. Dix. Semantics of (Disjunctive) Logic Programs Based on Partial Evaluation. Journal of Logic Programming, 40(1):1-46, 1999.
3. D. J. de Jongh and L. Hendriks. Characterizations of Strongly Equivalent Logic Programs in Intermediate Logics. Theory and Practice of Logic Programming, 3(3):259-270, 2003.
4. T. Eiter, W. Faber, N. Leone, and G. Pfeifer. Declarative Problem-Solving Using the DLV System. In Logic-Based Artificial Intelligence, pp. 79-103. Kluwer, 2000.
5. T. Eiter and M. Fink. Uniform Equivalence of Logic Programs under the Stable Model Semantics. In Proc. ICLP-03. To appear.
6. T. Eiter, M. Fink, H. Tompits, and S. Woltran. Eliminating Disjunction from Propositional Logic Programs under Stable Model Preservation. InProc. ASP-03. Available at: http://CEUR-WS.org/Vol-78/, 2003.
7. T. Eiter, G. Gottlob, and H. Mannila. Disjunctive Datalog. ACM Transactions on Database Systems, 22:364-418, 1997.
8. M. Gelfond and V. Lifschitz. Classical Negation in Logic Programs and Disjunctive Databases. New Generation Computing, 9:365-385, 1991.
9. T. Janhunen and E. Oikarinen. Testing the Equivalence of Logic Programs under Stable Model Semantics. In Proc. JELIA-02, LNCS 2424, pp. 493-504. Springer, 2002.
10. T. Janhunen and E. Oikarinen. LPEQ and DLPEQ - Translators for Automated Equivalence Testing of Logic Programs. In Proc. LPNMR-03. To appear.
11. V. Lifschitz, D. Pearce, and A. Valverde. Strongly Equivalent Logic Programs. ACM Transactions on Computational Logic, 2(4):526-541, 2001.
12. F. Lin. Reducing Strong Equivalence of Logic Programs to Entailment in Classical Propositional Logic. In Proc. KR-02, pp. 170-176. Morgan Kaufmann, 2002.
13. F. Lin and Y. Zhao. ASSAT: Computing Answer Sets of a Logic Program by SAT Solvers. In Proc. AAAI-2002, pp. 112-117. AAAI Press / MIT Press, 2002.
14. M. J. Maher. Equivalences of Logic Programs. In Minker [15], pp. 627-658.
15. J. Minker, editor. Foundations of Deductive Databases and Logic Programming. Morgan Kaufman, Washington DC, 1988.
16. M. Osorio, J. Navarro, and J. Arrazola. Equivalence in Answer Set Programming. In Proc. LOPSTR 2001, LNCS 2372, pp. 57-75. Springer, 2001.
17. D. Pearce, H. Tompits, and S. Woltran. Encodings for Equilibrium Logic and Logic Programs with Nested Expressions. In Proc. EPIA 2001, LNCS 2258, pp. 306-320. Springer, 2001.
18. D. Pearce and A. Valverde. Some Types of Equivalence for Logic Programs and Equilibrium Logic. In Proc. APPIA-GULP-PRODE 2003, 2003.
19. T. Przymusinski. Stable Semantics for Disjunctive Programs. New Generation Computing, 9:401-424, 1991.
20. Y. Sagiv. Optimizing Datalog Programs. In Minker [15], pp. 659-698.
21. P. Simons, I. Niemelä, and T. Soininen. Extending and Implementing the Stable Model Semantics. Artificial Intelligence, 138:181-234, 2002.
22. H. Turner. Strong Equivalence for Logic Programs and Default Theories (Made Easy). In Proc. LPNMR-01, LNCS 2173, pp. 81-92. Springer, 2001.
23. H. Turner. Strong Equivalence Made Easy: Nested Expressions and Weight Constraints. Theory and Practice of Logic Programming, 3(4-5):609-622, 2003.
24. K. Wang and L. Zhou. Comparisons and Computation of Well-founded Semantics for Disjunctive Logic Programs. ACM Transactions on Computational Logic. To appear. Available at: http://arxiv.org/abs/cs.AI/0301010, 2003.