Graph theoretical characterization and computation of answer sets

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2001, Pages 641-646

  Linke, Thomas ^a  

^a UNIVERSITY OF POTSDAM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ANSWER SET; BLOCK GRAPHS; GRAPH COLORINGS; GRAPH THEORETICAL CHARACTERIZATION; LOGIC PROGRAMS; POLYNOMIAL SPACE; RULE BASED;

ARTIFICIAL INTELLIGENCE; LOGIC PROGRAMMING;

GRAPH THEORY;

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

References (19)

1. A. Aggoun, D. Chan, P. Dufresne and other. Eclipse User Manual Release 5.0. ECLiPSe is available at http://www.icparc.ic.ac.uk/eclipse, 2000.
2. G. Brewka. Nonmonotonic Reasoning: Logical Foundations of Commonsense. Cambridge University Press, Cambridge, 1991.
3. G. Brignoli, S. Costantini, O. D'Antona, and A. Provetti. Characterizing and computing stable models of logic programs: the non-stratified case. In Proc. of Conf. on Information Technology, pp. 197-201, 1999.
4. P. Cholewiński, V.Marek, A.Mikitiuk, andM. Truszczyński. Experimenting with nonmonotonic reasoning. In Proc. of the Int. Conf. on Logic Programming, pp. 267-281. MIT Press, 1995.
5. P. Cholewiński, V. Marek, and M. Truszczyński. Default reasoning system DeReS. In Proc. KR-1996, pp. 518-528. Morgan Kaufmann Publishers, 1996.
6. Y. Dimopoulos and A. Torres. Graph theoretical structures in logic programs and default theories. Theoretical Computer Science, 170:209-244, 1996. (Pubitemid 126411634)
7. Y. Dimopoulos, B. Nebel, and J. Koehler. Encoding planning problems in non-monotonic logic programs. Proc. of the 4th European Conf. on Planing, pp. 169-181, Toulouse, France, 1997. Springer Verlag.
8. J. Doyle. A truth maintenance system. Artificial Intelligence, 12:231-272, 1979.
9. U. Egly, Th. Eiter, H. Tompits, and St. Woltran. Solving advanced reasoning tasks using quantified boolean formulae. Proc. AAAI-2000, pp. 417-422, 2000.
10. T. Eiter, N. Leone, C. Mateis, G. Pfeifer, and F. Scarcello. A deductive system for nonmonotonic reasoning. In J. Dix, U. Furbach, and A. Nerode, editors, LPNMR-1997, pages 363-374. Springer Verlag, 1997.
11. M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In Proc. of the Int. Conf. on Logic Programming, 1988.
12. M. Gelfond and V. Lifschitz. Logic programs with classical negation. In Proc. of the Int. Conf. on Logic Programming, pp. 579-597, 1990.
13. M. Gelfond and V. Lifschitz. Classical negation in logic programs and deductive databases. New Generation Computing, 9:365-385, 1991.
14. T. Janhunen, I. Niemelä, P. Simons, and J. You. Unfolding partiality and disjunctions in stable model semantics. In A.G. Cohn, F. Guinchiglia, and B.Selman, editors, Proc. KR-2000, pp. 411-419, 2000.
15. T. Linke and T. Schaub. Alternative foundations for Reiter's default logic. Artificial Intelligence, 124:31-86, 2000.
16. X. Liu, C. Ramakrishnan, and S.A. Smolka. Fully local and efficient evaluation of alternating fixed points. Proc. of the 4th Int. Conf. on Tools and Algorithms for the Construction Analysis of Systems, pp. 5-19, Lisbon, Portugal, 1998. Springer Verlag.
17. I. Niemelä and P. Simons. Smodels: An implementation of the stable model and well-founded semantics for normal logic programs. In J. Dix, U. Furbach, and A. Nerode, editors, Proc. LPNMR-1997, pp. 420-429. Springer, 1997.
18. I. Niemelä. Logic programming with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence, 25(3,4):241-273, 1999.
19. C. Papadimitriou and M. Sideri. Default theories that always have extensions. Artificial Intelligence, 69:347-357, 1994.