Complexity results for checking equivalence of stratified logic programs

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2007, Pages 330-335

  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

COMPLEXITY RESULTS; KNOWLEDGE REPRESENTATION AND REASONING; LOGIC PROGRAMS; LOWER BOUNDS; NEGATIVE CONSTRAINTS; NONMONOTONIC LOGIC; PROGRAM EQUIVALENCE; RECENT RESEARCHES;

ARTIFICIAL INTELLIGENCE; KNOWLEDGE REPRESENTATION; SEMANTICS;

LOGIC PROGRAMMING;

EID: 41149158288     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. C. Baral. Knowledge Representation, Reasoning and Declarative Problem Solving. CUP, 2003.
2. R. Ben-Eliyahu and R. Dechter. Propositional Semantics for Disjunctive Logic Programs. AMAI, 12:53-87, 1994.
3. E. Dantsin, T. Eiter, G. Gottlob, and A. Voronkov. Complexity and Expressive Power of Logic Programming. ACM CSUR, 33(3):374-425, 2001. (Pubitemid 33768487)
4. T. Eiter and M. Fink. Uniform Equivalence of Logic Programs under the Stable Model Semantics. In Proc. ICLP 2003, pp. 224-238, LNCS 2916.
5. T. Eiter, W. Faber, M. Fink, G. Pfeifer, and S. Woltran. Complexity of Answer Set Checking and Bounded Predicate Arities for Non-ground Answer Set Programming. In Proc. KR 2004, pp. 377-387, 2004.
6. T. Eiter, M. Fink, H. Tompits, and S. Woltran. Strong and Uniform Equivalence in Answer-Set Programming: Characterizations and Complexity Results for the Non-Ground Case. In Proc. AAAI 2005, pp. 695-700.
7. T. Eiter, M. Fink, and S. Woltran. Semantical Characterizations and Complexity of Equivalences in Stable Logic Programming. ACM TOCL. Forthcoming.
8. W. Faber and K. Konczak. Strong Equivalence for Logic Programs with Preferences. In Proc. IJCAI 2005, pp. 430-435.
9. T. Feder and Y.P. Saraiya. Decidability and Undecidability of Equivalence for Linear Datalog with Applications to Normal-Form Optimizations. In Proc. ICDT 1992, pp. 297-311, LNCS 646.
10. M. Gelfond and N. Leone. Logic Programming and Knowledge Representation - The AProlog Perspective. Artificial Intell., 138(1-2):3-38, 2002.
11. M. Gelfond and V. Lifschitz. Classical Negation in Logic Programs and Disjunctive Databases. New Generation Computing, 9:365-385, 1991.
12. L. M. Goldschlager. The Monotone and Planar Circuit Value Problems are Complete for P. SIGACT News, 9, 1977.
13. G. Gottlob and C. Papadimitriou. On the Complexity of Single-Rule Datalog Queries. Inf. Comput., 183(1):104-122, 2003.
14. A.Y. Halevy, I.S. Mumick, Y. Sagiv, and O. Shmueli. Static Analysis in Datalog Extensions. JACM, 48(5):971-1012, 2001.
15. A.Y. Levy and Y. Sagiv. Queries Independent of Updates. In Proc. VLDB 1993, pp. 171-181.
16. V. Lifschitz, D. Pearce, and A. Valverde. Strongly Equivalent Logic Programs. ACM TOCL, 2(4):526-541, 2001.
17. F. Lin. Reducing Strong Equivalence of Logic Programs to Entailment in Classical Propositional Logic. In Proc. KR 2002, pp. 170-176.
18. I. Niemelä. Logic Programs with Stable Model Semantics as a Constraint Programming Paradigm. AMAI, 25(3,4), 1999.
19. D. Pearce and A. Valverde. Uniform Equivalence for Equilibrium Logic and Logic Programs. In Proc. LPNMR 2004, LNCS 2923.
20. O. Shmueli. Decidability and Expressiveness Aspects of Logic Queries. In Proc. PODS 1987, pp. 237-249.