Suitable graphs for answer set programming

CEUR Workshop Proceedings

Volumn 78, Issue , 2003, Pages 15-28

  Linke, Thomas ^a  

^a UNIVERSITY OF POTSDAM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ANSWER SET; ANSWER SET PROGRAMMING; ANSWER SET SEMANTICS; DIFFERENT CLASS; LOGIC PROGRAMS; SUITABLE GRAPHS;

GRAPHIC METHODS; SEMANTICS;

LOGIC PROGRAMMING;

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

References (17)

1. C. Anger, K. Konczak, and T. Linke. NoMoRe: A system for non-monotonic reasoning under answer set semantics. In W. Faber T. Eiter and M. Truszczynski, editors, Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'01), pages 406-410. Springer, 2001.
2. K. R. Apt and R. N. Bol. Logic programming and negation: A survey. Journal of Logic Programming, 19/20:9-71, 1994.
3. 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.
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, Proc. of Conference on Information Technology, pages 197-201, Bhubaneswar, India, December 1999. AAAI Press.
5. S. Costantini. Comparing different graph representations of logic programs under the answer set semantics. In T. C. Son and A. Provetti, editors, Proc. of the AAAI Spring 2001 Symposium on: Answer Set Programming, Towards Efficient and Scalable Knowledge Representation and Reasoning, Stanford, CA, USA, 2001. AAAI Press.
6. S. Costantini, O. D'Antona, and A. Provetti. On the equivalence and range of applicability of graph-based representations of logic programs. Information Processing Letters, 84(5):241-249, 2002.
7. Y. Dimopoulos and A. Torres. Graph theoretical structures in logic programs and default theories. Theoretical Computer Science, 170:209-244, 1996.
8. D. East and M. Truszczynski. dcs: An implementation of datalog with constraints. In Proceedings of the National Conference on Artificial Intelligence. MIT Press, 2000.
9. M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In Proceedings of the International Conference on Logic Programming, pages 10701080. The MIT Press, 1988.
10. F. Fages. Consistency of clark's completion and existence of stable models, 1992. Volume 1 of Journal of Methods of Logic in Computer Science, pages 51-60. The MIT Press, 1994.
11. K. Konczak, T. Linke, and T. Schaub. Graphs and colorings for answer set programming. 2003. Submitted to LPNMR.
12. V. Lifschitz. Answer set planning. In Proceedings of the 1999 International Conference on Logic Programming, pages 23-37. MIT Press, 1999.
13. V. Lifschitz, L. Tang, and H. Turner. Nested expressions in logic programs. Annals of Mathematics and Artificial Intelligence, 25(3-4):369-389, 1999.
14. 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.
15. T. Linke. Using Nested Logic Programs for Answer Set Programming. 2003. Submitted to LPNMR.
16. T. Linke, C. Anger, and K. Konczak. More on nomore. In G. Ianni and S. Flesca, editors, Eighth European Workshop on Logics in Artificial Intelligence (JELIA'02), volume 2424 of Lecture Notes in Artificial Intelligence. Springer Verlag, 2002.
17. 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.