On finitely recursive programs

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

Volumn 4670 LNCS, Issue , 2007, Pages 89-103

  Baselice, S ^a   Bonatti, P A ^a   Criscuolo, G ^a  

^a UNIVERSITY OF NAPLES FEDERICO II   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; QUERY PROCESSING; SEMANTICS;

FINITE SUBSETS; INFINITE DOMAINS; LOGIC PROGRAMS; RECURSIVE PROGRAMS; STABLE MODEL SEMANTICS;

LOGIC PROGRAMMING;

EID: 38149025709     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74610-2_7     Document Type: Conference Paper

References (15)

1. Apt, K.R.: Introduction to Logic Programming. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science. Formal Model and Semantics, vol. B, pp. 495-574. Elsevier, Amsterdam and The MIT Press, Cambridge (1990)
2. Baral, C.: Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press, Cambridge (2003)
3. Bonatti, P.A.: Resolution for skeptical stable model semantics. J. Autom. Reasoning 27(4), 391-421 (2001)
4. Bonatti, P.A.: Reasoning with infinite stable models. Artif. Intell. 156(1), 75-111 (2004)
5. Eiter, T., Leone, N., Mateis, C., Pfeifer, G., Scarcello, F.: A deductive system for nonmonotonic reasoning. In: Fuhrbach, U., Dix, J., Nerode, A. (eds.) LPNMR 1997. LNCS, vol. 1265, pp. 364-375. Springer, Heidelberg (1997)
6. Van Emden, M.H., Kowalski, R.A.: The semantics of predicate logic as a programming language. J. ACM 23(4), 733-742 (1976)
7. Fages, F.: Consistency of Clark's completion and existence of stable models. Methods of Logic in Computer Science 1, 51-60 (1994)
8. Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Proc. of the 5th ICLP, pp. 1070-1080. MIT Press, Cambridge (1988)
9. Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Generation Computing 9(3-4), 365-386 (1991)
10. Lifschitz, V., Turner, H.: Splitting a Logic Program. In: Proceedings of the 12th International Conference on Logic Programming, Kanagawa 1995. MIT Press Series Logic Program, pp. 581-595. MIT Press, Cambridge (1995)
11. Lifschitz, V., Turner, H.: Splitting a logic program. In: International Conference on Logic Programming, pp. 23-37 (1994)
12. Lloyd, J.W.: Foundations of Logic Programming, 1st edn. Springer, Heidelberg (1984)
13. Marek, V.W., Remmel, J.B.: On the expressibility of stable logic programming. In: Eiter, T., Faber, W., Truszczyński, M. (eds.) LPNMR 2001. LNCS (LNAI), vol. 2173, pp. 107-120. Springer, Heidelberg (2001)
14. Niemelä, I., Simons, P.: Smodels -an implementation of the stable model and well-founded semantics for normal Ip. In: Fuhrbach, U., Dix, J., Nerode, A. (eds.) LPNMR 1997. LNCS, vol. 1265, pp. 421-430. Springer, Heidelberg (1997)
15. Turner, H.: Splitting a default theory. In: Shrobe, H., Senator, T. (eds.) Proceedings of the Thirteenth National Conference on Artificial Intelligence, pp. 645-651. AAAI Press, Menlo Park, California (1996)