Graphs and colorings for answer set programming

Theory and Practice of Logic Programming

Volumn 6, Issue 1-2, 2006, Pages 61-106

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

^a UNIVERSITY OF POTSDAM   (Germany)

Author keywords

Answer set computation; Answer set programming; Graph based characterization; Operational semantics

Indexed keywords

ALGORITHMS; COLORING; GRAPH THEORY; MATHEMATICAL OPERATORS;

ANSWER SET COMPUTATION; ANSWER SET PROGRAMMING; GRAPH-BASED CHARACTERIZATION; OPERATIONAL SEMANTICS;

LOGIC PROGRAMMING;

EID: 31644451449     PISSN: 14710684     EISSN: 14753081     Source Type: Journal    
DOI: 10.1017/S1471068405002528     Document Type: Article

References (51)

1. ANGER, C., KONCZAK, K. AND LINKE, T. 2002. noMoRe: Non-monotonie reasoning with logic programs. Proceedings of the Eighth European Conference on Logics in Artificial Intelligence (JELIA'02), Lecture Notes in Artificial Intelligence, S. Flesca, S. Greco, N. Leone and G. Ianni, editors, Lecture Notes in Computer Science, vol. 2424. Springer-Verlag, pp. 521-524.
2. APT, K., BLAIR, H. AND WALKER, A. 1987. Towards a theory of declarative knowledge. In: Foundations of Deductive Databases and Logic Programming, J. Minker, editor. Morgan Kaufmann, Chapter 2, pp. 89-148.
3. BARAL, C. AND GELFOND, M. 1994. Logic programming and knowledge representation. Journal of Logic Programming 12, 1-80.
4. BONATTI, P. 1996. Proof systems for default and autoepistemic logic. Proceedings Tableaux '96, P. Miglioli, U. Moscato, D. Mundici and M. Ornaghi, editors, Lecture Notes in Artificial Intelligence, vol. 1071. Springer-Verlag, pp. 127-142.
5. BONATTI, P. 2001. Resolution for skeptical stable model semantics. Journal of Automated Reasoning 21, 4, 391-421.
6. BONATTI, P. AND OLIVETTI, N. 1997. A sequent calculus for skeptical default logic. Proceedings Tableaux'97, D. Galmiche, editor, Lecture Notes in Artificial Intelligence, vol. 1227. Springer-Verlag, pp. 107-121.
7. BÖSEL, A., LINKE, T., AND SCHAU B, T. 2004. Profiling answer set programming: The visualization component of the noMoRe system. Proceedings of the Ninth European Conference on Logics in Artificial Intelligence (JELIA'04), J. Alferes and J. Leite, editors, Lecture Notes in Artificial Intelligence, vol. 3229. Springer-Verlag, pp. 702-705.
8. BRASS, S., DIX, J., FREITAG, B. AND ZUKOWSKI, U. 2001. Transformation-based bottom-up computation of the well-founded model. Theory and Practice of Logic Programming 1, 5, 497-538.
9. BRIGNOLI, G., COSTANTINI, S., D'ANTONA, O. AND PROVETTI, A. 1999. Characterizing and computing stable models of logic programs : the non-stratified case. Proceedings of the Conference on Information Technology, Bhubaneswar, India, C. Baral and H. Mohanty, editors, AAAI Press, pp. 197-201.
10. CALIMERI, F., FABER, W., LEONE, N. AND PFEIFER, G. 2001. Pruning operators for answer set programming systems. Technical Report INFSYS RR-1843-01-07, Technische Universität Wien. May.
11. CLARK, K. 1978. Negation as failure. In Logic and Data Bases, H. Gallaire and J. Minker, editprs, Plenum Press, pp. 293-322. cmodels. http://www.cs.utexas.edu/users/tag/cmodels.html.
12. COSTANTINI, S. 2001. Comparing different graph representations of logic programs under the answer set semantics. Proceedings of the AAAI Spring 2001 Symposium on: Answer Set Programming, Towards Efficient and Scalable Knowledge Representation and Reasoning, T. C. Son and A. Provetti, editors, AAAI Press, Stanford, CA.
13. COSTANTINI, S., D'ANTONA, O. AND PROVETTI, A. 2002. On the equivalence and range of applicability of graph-based representations of logic programs. Information Processing Letters 84, 5, 241-249.
14. COSTANTINI, S. AND PROVETTI, A. 2005. Normal forms for answer sets programming. Theory and Practice of Logic Programming (to appear).
15. DENECKER, M., MAREK, V. AND TRUSZCZYŃSKI, M. 2000. Approximations, stable operators, well-founded fixpoints and applications in nonmonotonic reasoning. In Logic-Based Artificial Intelligence, J. Minker, editor, Kluwer Academic, Dordrecht, pp. 127-144.
16. DIMOPOULOS, Y. AND TORRES, A. 1996. Graph theoretical structures in logic programs and default theories. Theoretical Computer Science 170, 209-244. dlv. http://www.dlvsystem.com.
17. EITER, T., FABER, W., LEONE, N. AND PFEIFER, G. 1999. The diagnosis frontend of the dlv system. AI Communications 12, 1-2, 99-111.
18. FABER, W. 2002. Dissertation, Technische Universität Wien.
19. FAGES, F. 1994. Consistency of clark's completion and the existence of stable models. Journal of Methods of Logic in Computer Science 1, 51-60.
20. FITTING, M. 2002. Fixpoint semantics for logic programming a survey. Theoretical Computer Science 278, 1-2, 25-51.
21. GELFOND, M. AND LIFSCHITZ, V. 1988. The stable model semantics for logic programming. Proceedings of the International Conference on Logic Programming, The MIT Press, pp. 1070-1080.
22. GELFOND, M. AND LIFSCHITZ, V. 1991. Classical negation in logic programs and disjunctive databases. New Generation Computing 9, 365-385.
23. JANHUNEN, T. 2000. Comparing the expressive powers of some syntactically restricted classes of logic programs. Proceedings of the First International Conference on Computational Logic (CL 2000), J. Lloyd, V. Dahl, U. Furbach, M. Kerber, K. Lau, C. Palamidessi, L. Pereira, Y. Sagiv and P. Stuckey, editors, Lecture Notes in Computer Science, vol. 1861. Springer-Verlag, pp. 852-866.
24. KONCZAK, K., LINKE, T. AND SCHAUB, T. Graphs and colorings for answer set programming. Computing Research Repository (CoRR). http://arxiv.org/abs/cs.AI/ 0502082. (Full version of this paper.)
25. KONCZAK, K., LINKE, T. AND SCHAUE, T. 2003. Graphs and colorings for answer set programming: Abridged report. Proceedings of the Second International Workshop on Answer Set Programming (ASP'03), M. D. Vos and A. Provetti, editors, Vol. 78. CEUR Workshop Proceedings, pp. 137-150.
26. KONCZAK, K., LINKE, T. AND SCHAUB, T. 2004. Graphs and colorings for answer set programming: Abridged report. Proceedings of the Seventh International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'04), V. Lifschitz and I. Niemelä, editors, Lecture Notes in Artificial Intelligence, vol. 2923. Springer-Verlag, pp. 127-140.
27. KONCZAK, K., SCHAUB, T. AND LINKE, T. 2003a. Graphs and colorings for answer set programming with preferences. Fundamenta Informaticae 57, 2-4, 393-421.
28. LEONE, N., FABER, W., PFEIFER, G., EITER, T., GOTTLOB, G., KOCH, C., MATEIS, C., PERRI, S. AND SCARCELLO, F. 2005. The DLV system for knowledge representation and reasoning. ACM Transactions on Computational Logic (to appear).
29. LIFSCHITZ, V. 1996. Foundations of logic programming. Principles of Knowledge Representation, G. Brewka, editor, CSLI Publications, pp. 69-127.
30. LIN, F. AND ZHAO, J. 2003. On tight logic programs and yet another translation from normal logic programs to propositional logic. IJCAI-03, Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, G. Gottlob and T. Walsh, editors, Morgan Kaufmann, pp. 853-858.
31. LIN, F. AND ZHAO, Y. 2004. Assat: computing answer sets of a logic program by sat solvers. Artificial Intelligence 157, 1-2, 115-137.
32. LINKE, T. 2001. Graph theoretical characterization and computation of answer sets. Proceedings of the International Joint Conference on Artificial Intelligence, B. Nebel, editor, Morgan Kaufmann, pp. 641-645.
33. LINKE, T. 2003. Using nested logic programs for answer set programming. Proceedings of the Second International Workshop on Answer Set Programming (ASP'03), M. de Vos and A. Provetti, editors, Vol. 78. CEUR Workshop Proceedings, pp. 181-194.
34. LINKE, T., ANGER, C. AND KONCZAK, K. 2002. More on noMoRe. Proceedings of the Eighth European Conference on Logics in Artificial Intelligence (JELIA'02), S. Flesca, S. Greco, N. Leone, and G.Ianni, editors, Lecture Notes in Artificial Intelligence, vol. 2424. Springer-Verlag, pp. 468-480.
35. LINKE, T. AND SCHAUB, T. 1998. An approach to query-answering in Reiter's default logic and the underlying existence of extensions problem. Logics in Artificial Intelligence, Proceedings of the Sixth European Workshop on Logics in Artificial Intelligence, J. Dix, L. F. del Cerro, and U. Furbach, editors, Lecture Notes in Artificial Intelligence, vol. 1489. Springer-Verlag, pp. 233-247.
36. LINKE, T. AND SCHAUB, T. 2000. Alternative foundations for Reiter's default logic. Artificial Intelligence 124, 1, 31-86.
37. LLOYD, J. 1987. Foundations of Logic Programming, 2nd ed. Symbolic Computation. Springer-Verlag.
38. LONC, Z. AND TRUSZCZYŃSKI, M. 2001. On the problem of computing the well-founded semantics. Theory and Practice of Logic Programming 1, 5, 591-609.
39. NIEMELÄ, I. AND SIMONS, P. 1996. Efficient implementation of the well-founded and stable model semantics. Proceedings of the Joint International Conference and Symposium on Logic Programming, M. Maher, editor, MIT Press, pp. 289-303.nomore. nomore. http://www.cs.uni-potsdam.de/~linke/nomore.
40. PAPADIMITRIOU, C. AND SIDERI, M. 1994. Default theories that always have extensions. Artificial Intelligence 69, 347-357.
41. PRZYMUSIMSKI, T. 1988. On the declarative semantics of deductive databases and logic programs. Foundations of Deductive Databases and Logic Programming, J. Minker, editor, Morgan Kaufmann, pp. 193-216.
42. PRZYMUSINSKI, T. 1990. The well-founded semantics coincides with the three-valued stable semantics. Fundamenta Informaticae 13, 4, 445-463.
43. REITER, R. 1980. A logic for default reasoning. Artificial Intelligence 13, 1-2, 81-132.
44. Ross, K. May 1992. A prodedural semantics for well-founded negation in logic programs. Journal of Logic Programming 13, 1, 1-22.
45. SACCÁ, D. AND ZANIOLO, C. 1990. Stable models and non-determinism in logic programs with negation. Proceedings of the Ninth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. ACM Press, pp. 205-217.
46. SAGONAS, K., SWIFT, T. AND WARREN, D. 1996. An abstract machine for computing the well-founded semantics. Proceedings of the Joint International Conference and Symposium on Logic Programming, M. Maher, editor, MIT Press, pp. 274-288.
47. SIMONS, P., NIEMELÄ, I., AND SOININEN, T. 2002. Extending and implementing the stable model semantics. Artificial Intelligence 138, 1-2, 181-234.smodels. http://www.tcs.hut.fi/Software/smodels.
48. SUBRAHMANIAN, V., NAU, D. AND VAGO, C. 1995. Wfs + branch and bound = stable models. IEEE Transactions on Knowledge and Data Engineering 7, 3, 362-377.
49. VAN GELDER, A. 1993. The alternating fixpoint of logic programs with negation. Journal of Computer and System Science 47, 185-120.
50. VAN GELDER, A., ROSS, K. AND SCHLIPF, J. S. 1991. The well-founded semantics for general logic programs. Journal of the ACM 38, 3, 620-650.
51. WARD, J. AND SCHLIPF, J. 2003. Answer set programming with clause learning. Proceedings of the Seventh International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'04), V. Lifschitz and I. Niemelä, editors, Lecture Notes in Artificial Intelligence, vol. 2923. Springer-Verlag, pp. 302-313.