Graphs and colorings for answer set programming with preferences: Preliminary report

CEUR Workshop Proceedings

Volumn 78, Issue , 2003, Pages 43-56

  Konczak, Kathrin ^a   Schaub, Torsten ^a   Linke, Thomas ^a  

^a UNIVERSITY OF POTSDAM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ANSWER SET; ANSWER SET PROGRAMMING; DEPENDENCY GRAPHS; PARTIAL COLORING; PROOF THEORY; RULE DEPENDENCY GRAPHS;

CHARACTERIZATION;

LOGIC PROGRAMMING;

EID: 84887033851     PISSN: 16130073     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. C. Anger, K. Konczak, and T. Linke. noMoRe: Non-monotonic reasoning with logic programs. In S. Flesca et al., editors, Proceedings of the Eighth European Conference on Logics inArtificiallntelligence (JELIA'02), pages 521-524. Springer, 2002.
2. G. Brewka. Well-Founded Semantics for Extended Logic Programs with Dynamic Preferences. Journal of Artificial Intelligence Research, 4:19-36, 1996.
3. G. Brewka and T. Eiter. Preferred Answer Sets for Extended Logic Programs. Artificial Intelligence, 109(1-2):297-356, 1999.
4. G. Brignoli, S. Costantini, O. D'Antona, and A. Provetti. Characterizing and computing stable models of logic programs: the non-stratified case. In C. Baral and H. Mohanty, editors, Proceedings ofthe Conference on Information Technology, Bhubaneswar, India, pages 197-201. AAAI Press, 1999.
5. J. Delgrande, T. Schaub and H. Tompits. A Framework for Compiling Preferences in Logic Programs. Theory and Practice of Logic Programming, 3(2):129-187, March 2003.
6. T. Eiter, W. Faber, N. Leone, G. Pfeifer. Computing preferred answer sets by meta-interpretation in answer set programming. Theory and Practice ofLogic Programming, 3(4-5):463-498, 2003.
7. M. Fitting. Fixpoint semantics for logic programming a survey. Theoretical Computer Science,278(1-2):25-51,2002.
8. M. Gelfond and T. Son. Reasoning with Prioritized Defaults. Third International Workshop on Logic Programming and Knowledge Representation, volume 1471 of lecture Notes in Computer Science, pages 164-223. Springer-Verlag, 1997.
9. B. Grosof. Prioritized Conflict Handling for Logic Programs. In J. Maluszynsk, editor, Logic Programming: Proceedings of the 1997 International Symposium, pages 197-211. The MIT Press, 1997.
10. K. Konczak, T. Linke and T. Schaub. Graphs and colorings for answer set programming: Abridged Report, 2003. To appear.
11. K. Konczak, T. Linke and T. Schaub. Graphs and colorings for answer set programming with preferences, 2003. In preparation.
12. N. Leone, W. Faber, G. Pfeifer, T. Eiter, G. Gottlob, C. Koch, C. Mateis, S. Perri and F. Scar-cello. The DLV System for Knowledge Representation and Reasoning. ACM Transactions on Computational Logic, 2003. To appear.
13. T. Linke. Graph theoretical characterization and computation of answer sets. In B. Nebel, editor, Proceedings of the International Joint Conference on Artificial Intelligence, pages 641-645. Morgan Kaufmann Publishers, 2001.
14. J.Lloyd. Foundations of Logic Programming. Springer, 1987.
15. I. Niemela, P. Simons and T. Soininen. Extending and implementing the stable model semantics. Artificial Intelligence, 138(1-2):181-234, 2002.
16. C. Sakama and K. Inoue. Prioritized Logic Programming and its Application to Common-sense Reasoning. Artificial Intelligence, 123(1-2):185-222, 2000.
17. T. Schaub and K. Wang. A semantic framework for preference handling in answer set programming. Theory and Practice ofLogic Programming, 3(4-5):569-607, 2003.
18. K. Wang, L. Zhou and F. Lin. Alternating fixpoint theory for logic programs with priority. In Proceedings ofthe First International Conference on Computational Logic, volume 1861 of Lecture Notes in Computer Science, pages 164-178. Springer-Verlag, 2000.
19. Y.Zhang. Two results for prioritized logic programming. In Theory and Practice of Logic Programming, 3(2):223-242, 2003.