An implementation for recognizing rule replacements in non-ground answer-set programs

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

Volumn 4160 LNAI, Issue , 2006, Pages 477-480

  Eiter, Thomas ^a   Traxler, Patrick ^a   Woltran, Stefan ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33750072613     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11853886_41     Document Type: Conference Paper

References (7)

1. S. Brass and J. Dix. Semantics of (Disjunctive) Logic Programs Based on Partial Evaluation. Journal of Logic Programming, 38(3): 167-213, 1999.
2. T. Eiter, M. Fink, H. Tompits, P. Traxler, and S. Woltran. Replacements in Non-Ground Answer-Set Programming. In Proc. KR'06, pg. 340-351. AAAI Press, 2006.
3. 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'05, pg. 695-700. AAAI Press, 2005.
4. V. Lifschitz, D. Pearce, and A. Valverde. Strongly Equivalent Logic Programs. ACM Transactions on Computational Logic, 2(4):526-541, 2001.
5. F. Lin and Y. Chen. Discovering Classes of Strongly Equivalent Logic Programs. In Proc. IJCAI'05, pages 516-521, 2005.
6. M. Osorio, J. A. Navarro, and J. Arrazola. Equivalence in Answer Set Programming. In Proc. LOPSTR'01, Selected Papers, vol. 2372 of LNCS, pg. 57-75. Springer, 2001.
7. P. Traxler. Techniques for Simplifying Disjunctive Datalog Programs with Negation. Master's thesis, Technische Universität Wien, Institut für Informationssysteme, 2006.