Graphs and colorings for answer set programming: Abridged report

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 2923, Issue , 2004, Pages 127-140

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

^a UNIVERSITY OF POTSDAM   (Germany)

^b SIMON FRASER UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

DEDUCTIVE DATABASES; GRAPH COLORING; LOGIC PROGRAMS; ALGORITHMIC APPROACH; ANSWER SET PROGRAMMING; DEPENDENCY GRAPHS; PARTIAL COLORING; PROOF THEORY; RULE DEPENDENCY GRAPHS; WELL FOUNDED SEMANTICS;

ARTIFICIAL INTELLIGENCE; COLOR; COMPUTER SCIENCE; GRAPH THEORY; INFORMATION SCIENCE; INFORMATION TECHNOLOGY; SET THEORY; CHARACTERIZATION; COMPUTATION THEORY; COMPUTER PROGRAMMING; SEMANTICS;

LOGIC PROGRAMMING;

EID: 9444267086     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

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 in Artificial Intelligence (JELIA'02), pages 521-524. Springer, 2002.
2. K. Apt, H. Blair, and A. Walker. Towards a theory of declarative knowledge. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming, pages 89-148. Morgan Kaufmann, 1987.
3. 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 of the Conference on Information Technology, Bhubaneswar, India, pages 197-201. AAAI Press, 1999.
4. Y. Dimopoulos and A. Torres. Graph theoretical structures in logic programs and default theories. Theoretical Computer Science, 170:209-244, 1996.
5. T. Eiter, N. Leone, C. Mateis, G. Pfeifer, and F. Scarcello. A deductive system for nonmonotonic reasoning. In J. Dix et al., editors, Proceedings of the Fourth International Conference on Logic Programming and Non-Monotonic Reasoning, pages 363-374. Springer, 1997.
6. F. Fages. Consistency of clark's completion and the existence of stable models. Journal of Methods of Logic in Computer Science, 1:51-60, 1994.
7. M. Fitting. Fixpoint semantics for logic programming a survey. Theoretical Computer Science, 278(1-2):25-51, 2002.
8. M. Gelfond and V. Lifschitz. Classical negation in logic programs and deductive databases. New Generation Computing, 9:365-385, 1991.
9. 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.
10. T. Linke. Using nested logic programs for answer set programming. In M. De Voss and A. Provetti, editors, Proceedings of the Workshop on Answer Set Programming: Advances in Theory and Implementation (ASP03). 181-194, CEUR, 2003.
11. T. Linke, C. Anger, and K. Konczak. Moreon noMoRe. In S. Flesca et al., editors, Proceedings of the Eighth European Conference on Logics in Artificial Intelligence (JELIA'02), pages 468-480, 2002.
12. T. Linke and T. Schaub. An approach to query-answering in Reiter's default logic and the underlying existence of extensions problem. In J. Dix et al., editors, Proceedings of the Sixth European Workshop on Logics in Artificial Intelligence, pages 233-247. Springer, 1998.
13. T. Linke and T. Schaub. Alternative foundations for Reiter's default logic. Artificial Intelligence, 124(1):31-86, 2000.
14. J. Lloyd. Foundations of Logic Programming. Springer, 1987.
15. I. Niemelä and P. Simons. Efficient implementation of the well-founded and stable model semantics. In M. Maher, editor, Proceedings of the Joint International Conference and Symposium on Logic Programming, pages 289-303. The MIT Press, 1996.
16. C. Papadimitriou and M. Sideri. Default theories that always have extensions. Artificial Intelligence, 69:347-357, 1994.
17. A. van Gelder, K. Ross, and J. S. Schlipf. The well-founded semantics for general logic programs. Journal of the ACM, 38(3):620-650, 1991.