FDNC: Decidable non-monotonic disjunctive logic programs with function symbols

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4790 LNAI, Issue , 2007, Pages 514-530

  Šimkus, Mantas ^a   Eiter, Thomas ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); COMPUTABILITY AND DECIDABILITY; CONSTRAINT THEORY; SEMANTICS; SET THEORY;

FUNCTION SYMBOLS; OPTIMAL REASONING;

LOGIC PROGRAMMING;

EID: 38149052892     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-75560-9_37     Document Type: Conference Paper

References (16)

1. Baselice, S., Bonatti, P.A., Criscuolo, G.: On Finitely Recursive Programs. In: Dahl, V., Niemelä, I. (eds.) ICLP 2007, September 8-13. LNCS, vol. 4670, pp. 89-103. Springer, Heidelberg (2007) http://dx.doi.org/10.1007/ 978-3-540-74610-2_7
2. Bonatti, P.A.: Reasoning with infinite stable models. Artif. Intell. 156(1), 75-111 (2004)
3. Eiter, T., Faber, W., Leone, N., Pfeifer, G., Polleres, A.: A Logic Programming Approach to Knowledge-State Planning: Semantics and Complexity. ACM Transactions on Computational Logic 5(2), 206-263 (2004)
4. Eiter, T., Gottlob, G.: On the Computational Cost of Disjunctive Logic Programming: Propositional Case. Annals of Mathematics and Artificial Intelligence 15(3/4), 289-323 (1995)
5. Eiter, T., Gottlob, G.: Expressiveness of stable model semantics for disjuncitve logic programs with functions. J. Log. Program. 33(2), 167-178 (1997)
6. Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Generation Comput. 9(3/4), 365-386 (1991)
7. Giunchiglia, E., Lifschitz, V.: An Action Language Based on Causal Explanation: Preliminary Report. In: AAAI 1998. Proceedings of the Fifteenth National Conference on Artificial Intelligence, pp. 623-630 (1998)
8. Heymans, S.: Decidable Open Answer Set Programming. PhD thesis, Theoretical Computer Science Lab (TINF), Department of Computer Science, Vrije Universiteit Brussel, Pleinlaan 2, B1050 Brussel, Belgium (February 2006)
9. Heymans, S., Nieuwenborgh, D.V., Vermeir, D.: Nonmonotonic ontological and rule-based reasoning with extended conceptual logic programs. In: Gómez-Pérez, A., Euzenat, J. (eds.) ESWC 2005. LNCS, vol. 3532, pp. 392-407. Springer, Heidelberg (2005)
10. Leone, N., Pfeifer, G., Faber, W., Eiter, T., Gottlob, G., Perri, S., Scarcello, F.: The DLV system for knowledge representation and reasoning. ACM Transactions on Computational Logic 7(3), 499-562 (2006)
11. Marek, V.W., Remmel, J.B.: On the expressibility of stable logic programming. In: LPNMR, pp. 107-120 (2001)4
12. Marek, W., Nerode, A., Remmel, J.: How Complicated is the Set of Stable Models of a Recursive Logic Program? Annals of Pure and Applied Logic 56, 119-135 (1992)
13. Minker, J. (ed.): Foundations of Deductive Databases and Logic Programming. Morgan Kaufmann, San Francisco (1988)
14. Motik, B., Horrocks, I., Sattler, U.: Bridging the Gap Between OWL and Relational Databases. In: Proc. of WWW 2007, pp. 807-816 (2007)
15. Simons, P., Niemelä, I., Soininen, T.: Extending and implementing the stable model semantics. Artificial Intelligence 138, 181-234 (2002)
16. Woltran, S.: Answer Set Programming: Model Applications and Proofs-of-Concept. Technical Report WP5, Working Group on Answer Set Programming (WASP, IST-FET-2001-37004) (July 2005), available at http://www.kr.tuwien.ac. at/projects/WASP/report.html