Bidirectional answer set programs with function symbols

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2009, Pages 765-771

  Eiter, Thomas ^a   Šimkus, Mantas ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

LOGIC PROGRAMMING;

ANSWER SET; ANSWER SET PROGRAMMING; COMPUTATIONAL COSTS; FUNCTION SYMBOLS; REASONING ABOUT ACTIONS; REASONING TASKS; RECENT RESEARCHES; RECURSIVE DATA STRUCTURES;

COMPUTABILITY AND DECIDABILITY;

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

References (14)

1. C. Baral. Knowledge Representation, Reasoning and Declarative Problem Solving. CUP, 2002.
2. S. Baselice, P. A. Bonatti, and G. Criscuolo. On finitely recursive programs. In ICLP-07, LNCS 4670, pp. 89-103. Springer, 2007.
3. P. A. Bonatti. Reasoning with infinite stable models. Artif. Intell., 156(1):75-111, 2004.
4. F. Calimeri, S. Cozza, G. Ianni, and N. Leone. Computable functions in ASP: Theory and implementation. In ICLP-08, LNCS 5366, pp. 407-424. Springer, 2008.
5. J. Chomicki and T. Imielinski. Finite representation of infinite query answers. ACM Trans. Database Syst., 18(2):181-223, 1993.
6. M. Gelfond and V. Lifschitz. Classical negation in logic programs and disjunctive databases. New Gen. Comput., 9(3/4):365-386, 1991.
7. Stijn Heymans. Decidable Open Answer Set Programming. Ph.D. Dissertation. Vrije Universiteit Brussel, 2006.
8. W. Marek, A. Nerode, and J. Remmel. The Stable Models of a Predicate Logic Program. Journal of Logic Programming, 21(3):129-153, 1994.
9. J. Minker (ed). Foundations of Deductive Databases & Logic Programming. Morgan Kaufm., 1988.
10. M. Simkus and T. Eiter. FDNC: Decidable non-monotonic disjunctive logic programs with function symbols. In LPAR-07, LNCS 4790, pp. 514-530. Springer, 2007.
11. T. Syrjänen. Omega-restricted logic programs. In LPNMR-01, LNCS 2173, pp. 267-279. Springer, 2001.
12. W. Thomas. Automata on infinite objects. In Handbook of Theor. Comp. Sci. (B), pp. 133-192. Elsevier, 1990.
13. Moshe Y. Vardi. Reasoning about the past with twoway automata. In Proc. ICALP-98, LNCS 1443, pp. 628-641.
14. S. Woltran. Answer Set Programming: Model applications and proofs-of-Concept. Available at http://www.kr.tuwien.ac.at/projects/WASP/report. html.