On Finitely Recursive Programs

Finitary programs are a class of logic programs admitting functions symbols and hence infinite domains. In this paper we prove that a larger class of programs, called finitely recursive programs, preserves most of the good properties of finitary programs under the stable model semantics, namely: (i) finitely recursive programs enjoy a compactness property; (ii) inconsistency check and skeptical reasoning are semidecidable; (iii) skeptical resolution is complete. Moreover, we show how to check inconsistency and answer skeptical queries using finite subsets of the ground program instantiation.

[1]  Victor W. Marek,et al.  On the Expressibility of Stable Logic Programming , 2001, LPNMR.

[2]  Michael Gelfond,et al.  Classical negation in logic programs and disjunctive databases , 1991, New Generation Computing.

[3]  Giovambattista Ianni,et al.  Computable Functions in ASP: Theory and Implementation , 2008, ICLP.

[4]  Vladimir Lifschitz,et al.  Splitting a Logic Program , 1994, ICLP.

[5]  Ilkka Niemelä,et al.  Logic programs with stable model semantics as a constraint programming paradigm , 1999, Annals of Mathematics and Artificial Intelligence.

[6]  Gerald Pfeifer,et al.  A Deductive System for Non-Monotonic Reasoning , 1997, LPNMR.

[7]  Krzysztof R. Apt,et al.  Introduction to Logic Programming , 1988 .

[8]  Victor W. Marek,et al.  Stable models and an alternative logic programming paradigm , 1998, The Logic Programming Paradigm.

[9]  Chitta Baral,et al.  Knowledge Representation, Reasoning and Declarative Problem Solving , 2003 .

[10]  Ilkka Niemelä,et al.  Smodels - An Implementation of the Stable Model and Well-Founded Semantics for Normal LP , 1997, LPNMR.

[11]  Thomas Eiter,et al.  \mathbbFDNC: Decidable Non-monotonic Disjunctive Logic Programs with Function Symbols , 2007, LPAR.

[12]  Piero A. Bonatti Resolution for Skeptical Stable Model Semantics , 2004, Journal of Automated Reasoning.

[13]  Hudson Turner,et al.  Signed Logic Programs , 1994, ILPS.

[14]  J. Lloyd Foundations of Logic Programming , 1984, Symbolic Computation.

[15]  Robert A. Kowalski,et al.  The Semantics of Predicate Logic as a Programming Language , 1976, JACM.

[16]  Piero A. Bonatti,et al.  Reasoning with infinite stable models , 2001, Artif. Intell..

[17]  François Fages,et al.  Consistency of Clark's completion and existence of stable models , 1992, Methods Log. Comput. Sci..

[18]  Hudson Turner,et al.  Splitting a Default Theory , 1996, AAAI/IAAI, Vol. 1.