Abstract
The class of finitary normal logic programs—identified recently, in [1]—makes it possible to reason effectively with function symbols, recursion, and infinite stable models. These features may lead to a full integration of the standard logic programming paradigm with the answer set programming paradigm. For all finitary programs, ground goals are decidable, while nonground goals are semidecidable. Moreover, the existing engines (that currently accept only much more restricted programs [11,7]) can be extended to handle finitary programs by replacing their front-ends and keeping their core inference mechanism unchanged. In this paper, the theory of finitary normal programs is extended to disjunctive programs. More precisely, we introduce a suitable generalization of the notion of finitary program and extend all the results of [1] to this class. For this purpose, a consistency result by Fages is extended from normal programs to disjunctive programs. We also correct an error occurring in [1].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
P. A. Bonatti. Reasoning with infinite stable models. Proc. of IJCAI’01, pp. 603–608, Morgan Kaufmann, 2001.
P. A. Bonatti. Prototypes for reasoning with infinite stable models and function symbols. Proc. of LPNMR’01, pp. 416–419, LNAI 2173, Springer, 2001.
P. A. Bonatti. Shift-based semantics: general results and applications. Technical report CD-TR 93/59, Technical University of Vienna, Computer Science Department, Institute of Information Systems, 1993.
P. Cholewiński, V. Marek, A. Mikitiuk, and M. Truszczyński. Experimenting with nonmonotonic reasoning. In Proc. of ICLP’95. MIT Press, 1995.
J. Dix, U. Furbach, A. Nerode. Logic Programming and Nonmonotonic Reasoning: 4th international conference, LPNMR’97, LNAI 1265, Springer Verlag, Berlin, 1997.
T. Eiter and G. Gottlob. Complexity results for disjunctive logic programming and applications to nonmonotonic logics. In Proc. of ILPS’93. MIT Press, 1993.
T. Eiter, N. Leone, C. Mateis, G. Pfeifer, F. Scarcello. A deductive system for nonmonotonic reasoning. In [5].
F. Fages. Consistency of Clark’s completion and existence of stable models. Methods of Logic in Computer Science 1:51–60, 1994.
G. Gottlob. Complexity results for nonmonotonic logics. Journal of Logic and Computation, 2:397–425, 1992.
V. Lifschitz, H. Turner. Splitting a logic program. In Proc. ICLP’94, pp. 23–37, MIT Press, 1994.
T. Syrjänen. Omega-restricted logic programs. Proc. of LPNMR’01, LNAI 2173, pp. 267–280, Springer, 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bonatti, P.A. (2002). Reasoning with Infinite Stable Models II: Disjunctive Programs. In: Stuckey, P.J. (eds) Logic Programming. ICLP 2002. Lecture Notes in Computer Science, vol 2401. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45619-8_23
Download citation
DOI: https://doi.org/10.1007/3-540-45619-8_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43930-1
Online ISBN: 978-3-540-45619-3
eBook Packages: Springer Book Archive