Complexity of rule redundancy in non-ground answer-set programming over finite domains

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

Volumn 4483 LNAI, Issue , 2007, Pages 123-135

  Fink, Michael ^a   Pichler, Reinhard ^a   Tompits, Hans ^a   Woltran, Stefan ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

FINITE DIFFERENCE TIME DOMAIN METHOD; MATHEMATICAL TRANSFORMATIONS; PROBLEM SOLVING;

ANSWER-SET PROGRAMMING; NON-GROUND PROGRAMS; TAUTOLOGICAL RULES;

LOGIC PROGRAMMING;

EID: 38049056724     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72200-7_12     Document Type: Conference Paper

References (17)

1. Eiter, T., Fink, M., Tompits, H., Woltran, S.: Strong and Uniform Equivalence in Answer-Set Programming: Characterizations and Complexity Results for the Non-Ground Case. In Proc. AAAI'05, AAAI Press (2005) 695-700
2. Lifschitz, V., Pearce, D., Valverde, A.: Strongly Equivalent Logic Programs. ACM Transactions on Computational Logic 2(4) (2001) 526-541
3. Brass, S., Dix, J.: Semantics of (Disjunctive) Logic Programs Based on Partial Evaluation. Journal of Logic Programming 38(3) (1999) 167-213
4. Osorio, M., Navarro, J.A., Arrazola, J.: Equivalence in Answer Set Programming. In Proc. LOPSTR'01. Volume 2372 of LNCS, Springer-Verlag (2001) 57-75
5. Inoue, K., Sakama, C.: Equivalence of Logic Programs Under Updates. In: Proc. JELIA'04. Volume 3229 of LNCS, Springer-Verlag (2004) 174-186
6. Lin, F., Chen, Y.: Discovering Classes of Strongly Equivalent Logic Programs. In Proc. IJCAI'05, (2005) 516-521
7. Eiter, T., Fink, M., Tompits, H., Traxler, P., Woltran, S.: Replacements in Non-Ground Answer-Set Programming. In Proc. KR'06, AAAI Press (2006) 340-351
8. Lassez, J.L., Marriott, K.: Explicit Representation of Terms Defined by Counter Examples. Journal of Automated Reasoning 3(3) (1987) 301-317
9. Kunen, K.: Answer Sets and Negation as Failure. In Proc. ICLP'87, MIT Press (1987) 219-228
10. Kapur, D., Narendran, P., Rosenkrantz, D., Zhang, H.: Sufficient-Completeness, Ground-Reducibility and their Complexity. Acta Informatica 28(4) (1991) 311-350
11. Gelfond, M., Lifschitz, V.: Classical Negation in Logic Programs and Disjunctive Databases. New Generation Computing 9 (1991) 365-385
12. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman (1979)
13. Wang, K., Zhou, L.: Comparisons and Computation of Well-founded Semantics for Disjunctive Logic Programs. ACM Transactions on Computational Logic 6(2) (2005) 295-327
14. Traxler, P.: Techniques for Simplifying Disjunctive Datalog Programs with Negation. Master's thesis, Technische Universität Wien, Institut für Informationssysteme (2006)
15. Pichler, R.: On the Complexity of H-Subsumption. In Proc. CSL'98. Volume 1584 of LNCS, Springer-Verlag (1998) 355-371
16. Eiter, T., Faber, W., Fink, M., Pfeifer, G., Woltran, S.: Complexity of Answer Set Checking and Bounded Predicate Arities for Non-ground Answer Set Programming. In Proc. KR'04, AAAI Press (2004) 377-387
17. Vardi, M.: On the Complexity of Bounded-Variable Queries. In Proc. PODS'95, (1995) 266-276