Abstract
In general, the set of stable models of a recursive propositional logic program can be quite complex. For example, it follows from results of Marek, Nerode, and Remmel [8] that there exists finite predicate logic programs and recursive propositional logic programs which have stable models but no hyperarithmetic stable models. In this paper, we shall define several conditions which ensure that recursive logic program has a stable model which is recursive.
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
H. Andreka, I. Nemeti. The Generalized Completeness of Horn Predicate Logic as a Programming Language. Acta Cybernetica 4(1978) pp. 3–10.
K.R. Apt. Logic programming.Handbook of Theoretical Computer Science (J. van Leeuven, ed.), Cambridge, MA: MIT Press, 1990.
K.R. Apt, H. A. Blair. Arithmetical Classification of Perfect Models of Stratified Programs. Fundamenta Informaticae 13 (1990) pp. 1–17.
D.R. Bean. Effective Coloration. Journal of Symbolic Logic 41(1976) pp. 469–480.
D. Cenzer and J.B. Remmel. II stack0 stack1-classes in Mathematics. Handbook of Recursive Mathematics: Volume 2 (Yu. L. Ershov, S.S. Goncharov, A. Nerode, and J.B. Remmel, eds.) Studies in Logic and the Foundations of Mathematics, vol. 139: 623–822, Elsevier, 1998.
M. Gelfond and V. Lifschitz. The stable semantics for logic programs. Proceedings of the 5th International Sympposium on Logic Programming, MIT Press, pp. 1070–1080, 1988.
W. Marek, A. Nerode, and J. B. Remmel. How complicated is the set of stable models of a recursive logic program? Annals of Pure and Applied Logic, 56 (1992), pp. 119–135.
W. Marek, A. Nerode, and J. B. Remmel. The stable models of predicate logic programs. Journal of Logic Programming, 21 (1994), pp. 129–154.
W. Marek, A. Nerode, and J. B. Remmel. Context for Belief Revision: FC-Normal Nonmonotonic Rule Systems, Annals of Pure and Applied Logic 67(1994) pp. 269–324.
R. Reiter. A logic for default reasoning. Artificial Intelligence, 13(1980), pp. 81–132.
R.M. Smullyan. Theory of Formal Systems, Annals of Mathematics Studies, no. 47, Princeton, N.J.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cenzer, D., Remmel, J.B., Vanderbilt, A. (1999). Locally Determined Logic Programs. In: Gelfond, M., Leone, N., Pfeifer, G. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 1999. Lecture Notes in Computer Science(), vol 1730. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46767-X_3
Download citation
DOI: https://doi.org/10.1007/3-540-46767-X_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66749-0
Online ISBN: 978-3-540-46767-0
eBook Packages: Springer Book Archive