Characterizations for relativized notions of equivalence in answer set programming

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

Volumn 3229, Issue , 2004, Pages 161-173

  Woltran, Stefan ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; CHARACTERIZATION; COMPUTER PROGRAMMING; LOGIC PROGRAMMING; COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; OPTIMIZATION; SET THEORY;

ANSWER SET PROGRAMMING; DISJUNCTIVE LOGIC PROGRAMS; EQUIVALENCE TESTS; LOGIC PROGRAMS; NONMONOTONIC LOGIC; RECENT RESEARCHES; STABLE MODEL;

EQUIVALENCE CLASSES; LOGIC PROGRAMMING;

ANSWER SET PROGRAMMING; EQUIVALENCE MODELS; LOGIC PROGRAMS; STABLE MODELS;

EID: 22944481869     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-30227-8_16     Document Type: Conference Paper

References (29)

1. N. Bidoit and C. Froidevaux. General Logical Databases and Programs: Default Logic Semantics and Stratification. Information and Computation, 91:15-54, 1991.
2. S. Brass and J. Dix. Semantics of (Disjunctive) Logic Programs Based on Partial Evaluation. Journal of Logic Programming, 38(3):167-213, 1999.
3. P. Cabalar. A Three-Valued Characterization for Strong Equivalence of Logic Programs. In Proc. AAAI-02, pg. 106-111. AAAI Press/MIT Press, 2002.
4. D. 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, W. Faber, N. Leone, and G. Pfeifer. Declarative Problem-Solving Using the DLV System. In Logic-Based Artificial Intelligence, pg. 79-103. Kluwer Academic, 2000.
6. T. Eiter and M. Fink. Uniform Equivalence of Logic Programs under the Stable Model Semantics. In Proc. ICLP-03, LNCS 2916, pg. 224-238. Springer, 2003.
7. T. Eiter, M. Fink, H. Tompits, and S. Woltran. On Eliminating Disjunctions in Stable Logic Programming. In Proc. KR-04, pg. 447-585. AAAI-Press, 2004.
8. T. Eiter, M. Fink, H. Tompits, and S. Woltran. Simplifying Logic Programs under Uniform and Strong Equivalence. In Proc. LPNMR-04, LNCS 2923, pg. 87-99. Springer, 2004.
9. T. Eiter and G. Gottlob. On the Computational Cost of Disjunctive Logic Programming: Propositional Case. Annals of Math. and Artificial Intelligence, 15(3/4):289-323, 1995.
10. T. Eiter, G. Gottlob, and H. Mannila. Disjunctive Datalog. ACM Transactions on Database Systems, 22:364-418, 1997.
11. M. Gelfond and V. Lifschitz. Classical Negation in Logic Programs and Disjunctive Databases. New Generation Computing, 9:365-385, 1991.
12. K. Inoue and C. Sakama. Equivalence of Logic Programs under Updates. In Proc. JELIA-04. This volume.
13. T. Janhunen, I. Niemelä, P. Simons, and J.-H. You. Partiality and Disjunctions in Stable Model Semantics. In Proc. KR-00, pg. 411-419. Morgan Kaufmann, 2000.
14. T. Janhunen and E. Oikarinen. LPEQ and DLPEQ - Translators for Automated Equivalence Testing of Logic Programs. In Proc. LPNMR-04, LNCS 2923, pg. 336-340. Springer, 2004.
15. V. Lifschitz, D. Pearce, and A. Valverde. Strongly Equivalent Logic Programs. ACM Transactions on Computational Logic, 2(4):526-541, 2001.
16. V. Lifschitz and H. Turner. Splitting a Logic Program. In Proc. ICLP-94, pg. 23-38. 1994.
17. F. Lin. Reducing Strong Equivalence of Logic Programs to Entailment in Classical Propositional Logic. In Proc. KR-02, pg. 170-176. Morgan Kaufmann, 2002.
18. M. J. Maher. Equivalences of Logic Programs. In Minker [20], pg. 627-658.
19. W. Marek and M. Truszczyński. Autoepistemic Logic. J. of the ACM, 38(3):588-619, 1991.
20. J. Minker, editor. Foundations of Deductive Databases and Logic Programming. Morgan Kaufmann, 1988.
21. E. Oikarinen and T. Janhunen. Verifying the Equivalence of Logic programs in the Disjunctive Case. In Proc. LPNMR-04, LNCS 2923, pg. 180-193. Springer, 2004.
22. M. Osorio, J. A. Navarro, and J. Arrazola. Equivalence in Answer Set Programming. In Proc. LOPSTR-01, LNCS 2372, pg. 57-75. Springer, 2001.
23. D. Pearce, H. Tompits, and S. Woltran. Encodings for Equilibrium Logic and Logic Programs with Nested Expressions. In Proc. EPIA-01, LNCS 2258, pg. 306-320. Springer, 2001.
24. D. Pearce and A. Valverde. Uniform Equivalence for Equilibrium Logic and Logic Programs. In Proc. LPNMR-04, LNCS 2923, pg. 194-206. Springer, 2004.
25. T. Przymusinski. Stable Semantics for Disjunctive Programs. New Generation Computing Journal, 9:401-424, 1991.
26. Y. Sagiv. Optimizing Datalog Programs. In Minker [20], pg. 659-698.
27. O. Shmueli. Equivalence of Datalog Queries is Undecidable. Journal of Logic Programming, 15(3):231-242, 1993.
28. H. Turner. Strong Equivalence for Logic Programs and Default Theories (Made Easy). In Proc. LPNMR-01, LNCS 2173, pg. 81-92, Springer, 2001.
29. H. Turner. Strong Equivalence Made Easy: Nested Expressions and Weight Constraints. Theory and Practice of Logic Programming, 3(4-5):602-622, 2003.