Using nested logic programs for answer set programming

CEUR Workshop Proceedings

Volumn 78, Issue , 2003, Pages 181-194

  Linke, Thomas ^a  

^a UNIVERSITY OF POTSDAM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ANSWER SET; ANSWER SET PROGRAMMING; GENERAL METHOD; GRAPH TRANSFORMATION; LOGIC PROGRAMS; SUBGRAPHS;

GRAPH THEORY; SEMANTICS; STRUCTURAL PROPERTIES;

LOGIC PROGRAMMING;

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

References (20)

1. C. Anger, K. Kcmczak, and T. Linke. NoMoRe: Non-monotonic reasoning with logic programs. In G. Ianni and S. Flesca, editors, (JELIA'02), volume 2424 of LNAI. Springer Verlag, 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, chapter 2, pages 89-148. Morgan Kaufmann Publishers, 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, Proc. of Conference on Information Technology, pages 197-201, Bhubaneswar, India, December 1999. AAAI Press.
4. Y. Dimopoulos and A. Torres. Graph theoretical structures in logic programs and default theories. Theoretical Computer Science, 170:209-244, 1996.
5. D. East and M. Truszczyński. dcs: An implementation of datalog with constraints. In Proceedings of the National Conference on Artificial Intelligence. MIT Press, 2000.
6. 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, volume 1265 of LNAI, pages 363-374. Springer Verlag, 1997.
7. W. Faber, N. Leone, and G. Pfeifer. Pushing goal derivation in dip computations. In M. Gelfond, N. Leone, and G. Pfeifer, editors, LPNMR'99, volume 1730 of LNAI, pages 177-191, El Paso, Texas, USA, 1999. Springer Verlag.
8. W. Faber, N. Leone, and G. Pfeifer. Experimenting with heuristics for answer set programming. In B. Nebel, editor, IJCAI, pages 635-640. Morgan Kaufmann Publishers, 2001.
9. F. Fages. Consistency of dark's completion and existence of stable models, 1992.
10. M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In Proceedings of the International Conference on Logic Programming, pages 1070-1080. The MIT Press, 1988.
11. M. Gelfond and V. Lifschitz. Classical negation in logic programs and deductive databases. New Generation Computing, 9:365-385, 1991.
12. T. Janhunen. Comparing the expressive power of some syntactically restricted classes of logic programs. In Dix J, L. Ferinas del Cerro, and U. Furbach, editors, Proceedings of the 1st International Conference on Computational Logic, number 1861 in LNAI, pages 852-866. Springer Verlag, 2000.
13. K. Konczak, T. Linke, and T. Schaub. Graphs and colorings for answer set programming: Abridged report. 2003. Submitted to LPNMR.
14. V. Lifschitz. Answer set planning. In Proceedings of the 1999 International Conference on Logic Programming, pages 23-37. MIT Press, 1999.
15. V. Lifschitz, L. Tang, and H. Turner. Nested expressions in logic programs. Annals of Mathematics and Artificial Intelligence, 25(3-4):369-389, 1999.
16. T. Linke. Graph theoretical characterization and computation of answer sets. In B. Nebel, editor, IJCAI, pages 641-645. Morgan Kaufmann Publishers, 2001.
17. T. Linke, C. Anger, and K. Konczak. More on nomore. In G. Ianni and S. Flesca, editors, JELIA '02, volume 2424 of LNAI. Springer Verlag, 2002.
18. I. Niemela 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, LPNMR, pages 420-429. Springer, 1997.
19. I. Niemela and P. Simons. Extending the smodels system with cardinality and weight constraints. Logic-Based Artificial Intelligence, pages 491-521, 2000.
20. J. You, L. Yuan, and M. Zhange. On the equivalence between answer sets and models of completion for nested logic programs. In Proc. IJCAI0S, page to appear, 2003.