On finitely recursive programs

Theory and Practice of Logic Programming

Volumn 9, Issue 2, 2009, Pages 213-238

  Baselice, Sabrina ^a   Bonatti, Piero A ^a   Criscuolo, Giovanni ^a  

^a UNIVERSITY OF NAPLES FEDERICO II   (Italy)

Author keywords

Answer set programming with infinite domains; Compactness; Finitary programs; Infinite stable models; Skeptical resolution

Indexed keywords

ANSWER SET PROGRAMMING WITH INFINITE DOMAINS; COMPACTNESS; FINITARY PROGRAMS; INFINITE STABLE MODELS; SKEPTICAL RESOLUTION;

COMPUTABILITY AND DECIDABILITY; COMPUTATIONAL LINGUISTICS; FARM BUILDINGS; LOGIC PROGRAMMING; RECURSIVE FUNCTIONS; SEMANTICS;

MODEL CHECKING;

EID: 69749095444     PISSN: 14710684     EISSN: 14753081     Source Type: Journal    
DOI: 10.1017/S147106840900372X     Document Type: Article

References (21)

1. BARAL, C. 2003. Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press, Cambridge.
2. BASELICE, S., BONATTI, P. A. AND CRISCUOLO, G. 2007. On finitely recursive programs. In ICLP, V. Dahl and I. Niemelä, Eds. Lecture Notes in Computer Science, vol. 4670. Springer, 89-103.
3. BONATTI, P. A. 1993. Shift-Based Semantics: General Results and Applications. Tech. Rep. CD-TR 93/59, Computer Science Department, Institute of Information Systems, Technical University of Vienna, Vienna.
4. BONATTI, P. 2001a. Prototypes for reasoning with infinite stable models and function symbols. In Logic Programming and Nonmonotonic Reasoning, 6th International Conference, LPNMR 2001, T. Eiter, W. Faber, and M. Truszczynski, Eds. Lecture Notes in Computer Science, vol.2173. Springer, Vienna, Austria, 416-419.
5. BONATTI, P. A. 2001b. Resolution for skeptical stable model semantics. Journal of Automatic Reasoning 27, 4, 391-421.
6. BONATTI, P. A. 2002. Reasoning with infinite stable models II: Disjunctive programs. In ICLP, P. J. Stuckey, Ed. Lecture Notes in Computer Science, vol.2401. Springer, 333-346.
7. BONATTI, P. A. 2004. Reasoning with infinite stable models. Artificial Intelligence 156, 1, 75-111.
8. CALIMERI, F., COZZA, S., IANNI, G. AND LEONE, N. 2008. Computable functions in ASP: Theory and implementation. In ICLP, M. G. de la Banda and E. Pontelli, Eds. Lecture Notes in Computer Science, vol.5366. Springer, 407-424.
9. EITER, T., LEONE, N., MATEIS, C., PFEIFER, G. AND SCARCELLO, F. 1997. A deductive system for non-monotonic reasoning. In Logic Programming and Nonmonotonic Reasoning, 4th International Conference, LPNMR'97, Proceedings, J. Dix, U. Furbach, and A. Nerode, Eds. Lecture Notes in Computer Science, vol.1265. Springer, Dagstuhl, Germany, 364-375.
10. FAGES, F. 1994. Consistency of Clark's completion and existence of stable models. Methods of Logic in Computer Science 1, 51-60.
11. GELFOND, M. AND LIFSCHITZ, V. 1988. The stable model semantics for logic programming. In Proc. of the 5th ICLP. MIT Press, 1070-1080.
12. GELFOND, M. AND LIFSCHITZ, V. 1991. Classical negation in logic programs and disjunctive databases. New Generation Computing 9, 3-4, 365-386.
13. LIFSCHITZ, V. AND TURNER, H. 1994. Splitting a logic program. In International Conference on Logic Programming, P. Van Entenryck, Ed. S. Margherita Ligure, MIT Press, 23-37.
14. LLOYD, J. W. 1984. Foundations of Logic Programming, 1st ed. Springer.
15. MAREK, V. AND REMMEL, J. 2001. On the expressibility of stable logic programming. In Logic Programming and Nonmonotonic Reasoning, 6th International Conference, LPNMR 2001, T. Eiter, W. Faber, and M. Truszczynski, Eds. Lecture Notes in Computer ́ Science, vol.2173. Springer, Vienna, Austria, 107-120.
16. MAREK, V. W. AND TRUSZCZYNSKI, M. 1998. Stable models and an alternative logic programming paradigm. Computing Research Repository, CoRR cs.LO/9809032.(http://arxiv.org/corr)
17. NIEMELÄ, I. 1999. Logic programs with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence 25, 3-4, 241-273.
18. NIEMELÄ, I. AND SIMONS, P. 1997. Smodels-an implementation of the stable model and well-founded semantics for normal LP. In Logic Programming and Nonmonotonic Reasoning, 4th International Conference, LPNMR'97, Proceedings, J. Dix, U. Furbach, and A. Nerode, Eds. Lecture Notes in Computer Science, vol.1265. Springer, Dagstuhl, Germany, 421-430.
19. SIMKUS, M. AND EITER, T. 2007. FDNC: Decidable non-monotonic disjunctive logic programs with function symbols. In 14th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, LPAR 2007, N. Dershowitz and A. Voronkov, Eds. Lecture Notes in Computer Science, vol.4790. Springer, Yerevan, Armenia, 514-530.
20. TURNER, H. 1994. Signed logic programs. In SLP, M. Bruynooghe, Ed. MIT Press, Itaha, New York, 61-75.
21. TURNER, H. 1996. Splitting a default theory. In Proceedings of the Thirteenth National Conference on Artificial Intelligence, H. Shrobe and T. Senator, Eds. AAAI Press, Menlo Park, CA, 645-651.