On the interpretation of infinite computations in logic programming
We study in this paper the operational and greatest fixpoint semantics of infinite computations in logic programming. We show their equivalence in the case of fair derivations, and generalize to infinite computations some important results about finite ones.
KeywordsLogic Program Logic Programming Derivation Step Successful Derivation Empty Clause
Unable to display preview. Download preview PDF.
- .K.R. Apt, M.H. van Emden: Contributions to the theory of logic programming, JACM 29, 3 (1982), pp. 841–862.Google Scholar
- .A. Arnold, M. Nivat: The metric space of infinite trees. Algebraic and topological properties, Fundamenta Informaticae 3, 4 (1980), pp. 445–476.Google Scholar
- .E.W. Dijkstra: A discipline of programming, Prentice Hall, (1976).Google Scholar
- .F. Hausdorff: Set theory, Chelsea Publishing Company, New York (1962).Google Scholar
- .R.A. Kowalski: Logic for problem solving, Elsevier North Holland, New York, (1979).Google Scholar
- .R.A. Kowalski, M.H. van Emden: The semantics of logic as a programming language, JACM 23, 4 (1976), pp. 733–742.Google Scholar
- .J.L. Lassez, M.J. Maher: Closure and fairness in the semantics of logic programming, T.C.S. (to appear).Google Scholar
- .T. Moto-Oka: Overview of the fifth generation computer project, SIGARCH Newsletter 11(3), 1983, pp. 417–422.Google Scholar
- .M.A. Nait-Abdallah, M.H. van Emden: Algorithm theory and logic programming, (draft manuscript).Google Scholar
- .J.A. Robinson: A machine-oriented logic based on the resolution principle, JACM 12, 1 (1965), pp. 23–41.Google Scholar