Strong equivalence for logic programs with preferences

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2005, Pages 430-435

  Faber, Wolfgang ^a   Konczak, Kathrin ^b  

^a UNIVERSITY OF CALABRIA   (Italy)

^b UNIVERSITY OF POTSDAM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ANSWER SET; ANSWER SET PROGRAMMING; AUTOMATED OPTIMIZATION; LOGIC PROGRAMS; MODULAR PROGRAMMING; SIMPLIFICATION METHOD; SUFFICIENT CONDITIONS;

ARTIFICIAL INTELLIGENCE; SEMANTICS;

LOGIC PROGRAMMING;

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

References (12)

1. G. Brewka and T. Eiter. Preferred answer sets for extended logic programs. Artificial Intelligence, 109(1-2):297-356, 1999.
2. J. Delgrande, T. Schaub, and H. Tompits. A framework for compiling preferences in logic programs. TPLP, 3(2):129-187, 2003.
3. J. Delgrande, T. Schaub, H. Tompits, and K. Wang. A classification and survey of preference handling approaches in nonmonotonic reasoning. Computational Intelligence, 20(2):308-334, 2004.
4. T. Eiter, M. Fink, H. Tompits, and S. Woltran. Simplifying logic programs under uniform and strong equivalence. In LPNMR'04, pages 87-99. Springer, 2004.
5. T. Eiter, M. Fink, G.Sabbatini, and H. Tompits. A Generic Approach for Knowledge-Based Information Site Selection. In KR-02, pages 459-469. Morgan Kaufmann, 2002.
6. M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In ICLP, pages 1070-1080. The MIT Press, 1988.
7. V. Lifschitz, D. Pearce, and A. Valverde. Strongly Equivalent Logic Programs. ACM TOCL, 2(4):526-541, 2001.
8. M. Osorio, J.A. Navarro, and J. Arrazola. Equivalence in answer set programming. In LOPSTR, pages 57-75. Springer, 2001.
9. http://www.cs.uni-potsdam.de/∼torsten/plp, 2002.
10. T. Schaub and K. Wang. A semantic framework for preference handling in answer set programming. TPLP, 3(4-5):569-607, 2003.
11. H. Turner. Strong equivalence made easy: nested expressions and weight constraints. TPLP, 3(4-5):609-622, 2003.
12. K. Wang, L. Zhou, and F. Lin. Alternating Fix-point Theory for Logic Programs with Priority. In CL 2000, pages 164-178. Springer.