Abstract
This paper aims to define a complete semantics for a class of non-terminating logic programs. Standard approaches to deal with this problem consist in concentrating on programs where infinite derivations can be seen as computing, in the limit, some ”infinite object”. This is usually done by extending the domain of computation with infinite elements and then defining the meaning of programs in terms of greatest fixpoints. The main drawback of these approaches is that the semantics defined is not complete. The approach considered here is exactly the opposite. We concentrate on the infinite derivations that do not compute an infinite term: this paper studies the operational counterpart of the greatest fixpoint of the one-step-inference operator for the \( \mathcal{C} \)-semantics. The main result is that such fixpoint corresponds to the set of atoms that have a non-failing fair derivation with the additional property that complete information over a variable is obtained after finitely many steps.
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.
Similar content being viewed by others
References
M.A. Nait Abdallah. On the interpretation of infinite computations in logic programming. In J. Paredaens, editor, 11th International Colloquium on Automata, Languages and Programming, ICALP’84, volume 172 of LNCS, pages 358–370. Springer-Verlag, 1984.
P. Aczel. An introduction to inductive definitions. In K.J. Barwise, editor, Handbook of Mathematical Logic, Studies in Logic and Foundations of Mathematics. North Holland, 1977.
T. Coquand. Infinite objects in type theory. In H. Barendregt and T. Nipkow, editors, 1st International Workshop on Types for Proofs and Programs, TYPES’93, volume 806 of LNCS, pages 62–78. Springer-Verlag, 1994.
F.S. de Boer, A. Di Pierro, and C. Palamidessi. Nondeterminism and infinite computations in constraint programming. Theoretical Computer Science, 151(1):37–78, 1995.
P. Deransart and J. Maluszynski. A Grammatical View of Logic Programming. The MIT Press, 1993.
M. Falaschi, G. Levi, C. Palamidessi, and M. Martelli. Declarative modelingof the operational behavior of logic languages. Theoretical Computer Science, 69(3):289–318, 1989.
W.G. Golson. Toward a declarative semantics for infinite objects in logic programming. Journal of Logic Programming, 5(2):151–164, 1988.
J. Hein. Completions of perpetual logic programs. Theoretical Computer Science, 99(1):65–78, 1992.
G. Huet. A Uniform Approach to Type Theory, volume Logical Foundations of Functional Programming, pages 337–398. Addison-Wesley, 1990.
J. Ja.ar and J.L. Lassez. Constraint Logic Programming. Technical Report 86/74, Monash University, Victoria, Australia, June 1986.
J. Ja.ar and P.J. Stuckey. Semantics of infinite tree logic programming. Theoretical Computer Science, 46(2–3):141–158, 1986.
M. Jaume. Logic programming and co-inductive definitions. Research Report 98–140, Enpc-Cermics, 1998.
M. Jaume. A full formalisation of SLD-resolution in the calculus of inductive constructions. Journal of Automated Reasoning, 23(3-4):347–371, 1999.
R. Lalement. Computation as Logic. Prentice Hall International Series in Computer Science, 1993.
G. Levi and C. Palamidessi. Contributions to the semantics of logic perpetual processes. Acta Informatica, 25(6):691–711, 1988.
J.W. Lloyd. Foundations of Logic Programming. Springer-Verlag, 1987.
L.C. Paulson and A.W. Smith. Logic programming, functional programming, and inductive definitions. In P. Schroeder-Heister, editor, International Workshop on Extensions of Logic Programming, volume 475 of LNCS, pages 283–310. Springer-Verlag, 1989.
A. Podelski, W. Charatonik, and M. Müller. Set-based failure analysis for logic programs and concurrent constraint programs. In S. Doaitse Swierstra, editor, 8th European Symposium on Programming, ESOP’99, LNCS, pages 177–192. Springer-Verlag, 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jaume, M. (2000). Logic Programming and Co-inductive Definitions. In: Clote, P.G., Schwichtenberg, H. (eds) Computer Science Logic. CSL 2000. Lecture Notes in Computer Science, vol 1862. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44622-2_23
Download citation
DOI: https://doi.org/10.1007/3-540-44622-2_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67895-3
Online ISBN: 978-3-540-44622-4
eBook Packages: Springer Book Archive