Uniform equivalence of logic programs under the stable model semantics

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

Volumn 2916, Issue , 2003, Pages 224-238

  Eiter, Thomas ^a   Fink, Michael ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Answer set semantics; Computational complexity; Program optimization; Stable models; Strong equivalence; Uniform equivalence

Indexed keywords

ANSWER SET SEMANTICS; PROGRAM OPTIMIZATION; STABLE MODEL; STRONG EQUIVALENCE; UNIFORM EQUIVALENCE;

COMPUTATIONAL COMPLEXITY; LOGIC PROGRAMMING; SEMANTICS; APPLICATION PROGRAMS; COMPUTER CIRCUITS; PROBLEM SOLVING; RECONFIGURABLE HARDWARE;

EQUIVALENCE CLASSES;

EID: 0348155880     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24599-5_16     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. R. Ben-Eliyahu and L. Palopoli. Reasoning with minimal models: Efficient algorithms and applications. In Proc. KR'94, pp. 39-50, 1994.
3. P. Cabalar. A three-valued characterization for strong equivalence of logic programs. In Proc. AAAI '02, pp. 106-111, 2002.
4. 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.
5. T. Eiter, G. Gottlob, and H. Mannila. Disjunctive datalog. ACMTODS, 22(3):364-417, 1997.
6. T. Eiter and M. Fink. Uniform equivalence of logic programs under the stable model semantics. Tech. Rep. INFSYS RR-1843-03-08, Inst. für Informationssysteme, TUWien, 2003.
7. T. Eiter, M. Fink, H. Tompits, and S.Woltran. Simplifying logic programs under uniform and strong equivalence. Manuscript, submitted, July 2003.
8. T. Eiter, M. Fink, H. Tompits, and S. Woltran. Eliminating disjunction from propositional logic programs under stable model preservation. Manuscript, submitted, August 2003.
9. M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In Logic Programming: Proc. Fifth Int'l Conference and Symposium, pp. 1070-1080, 1988.
10. M. Gelfond andV. Lifschitz. Classical negation in logic programs and disjunctive databases. New Generation Computing, 9:365-385, 1991.
11. N. Leone, G. Pfeifer,W. Faber, T. Eiter, G. Gottlob, C. Koch, C. Mateis, S. Perri, and F. Scarcello. The DLV system for knowledge representation and reasoning. Tech. Rep. INFSYS RR-1843-02-14, Inst. für Informationssysteme, TUWien, 2002.
12. V. Lifschitz, D. Pearce, and A.Valverde. Strongly equivalent logic programs. ACM Trans. on Computational Logic, 2(4):526-541, 2001.
13. V. Lifschitz and H. Turner. Splitting a logic program. In Proc. ICLP-94, pp. 23-38, 1994.
14. F. Lin. Reducing strong equivalence of logic programs to entailment in classical propositional logic. In Proc. KR-2002, pp. 170-176, 2002.
15. F. Lin and Y. Zhao. ASSAT: Computing answer sets of a logic program by SAT solvers. In Proc. AAAI-2002, pp. 112-117, 2002.
16. M. J. Maher. Equivalences of logic programs. In Minker [17], pp. 627-658.
17. J. Minker, editor. Foundations of Deductive Databases and Logic Programming. Morgan Kaufmann, 1988.
18. I. Niemelä, P. Simons, and T. Syrjänen. Smodels: A system for answer set programming. In Proc. 8th Int'l Workshop on Non-Monotonic Reasoning (NMR'2000), 2000.
19. 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, 2001.
20. D. Pearce and A. Valverde. Some types of equivalence for logic programs and equilibrium logic. In Proc. Joint Conf. Declarative Programming (APPIA-GULP-PRODE), 2003.
21. T. Przymusinski. Stable semantics for disjunctive programs. New Generation Computing, 9:401-424, 1991.
22. Y. Sagiv. Optimizing datalog programs. In Minker [17], pp. 659-698.
23. H. Turner. Strong equivalence for logic programs and default theories (made easy). In Proc. LPNMR-01, LNCS 2173, pp. 81-92, 2001.
24. H. Turner. Strong equivalence made easy: nested expressions and weight constraints. Theory and Practice of Logic Programming, 3(4-5):609-622, 2003.