Skip to main content
SpringerLink
Log in

On the interpretation of infinite computations in logic programming

  • Conference paper
  • First Online:
Book cover Automata, Languages and Programming (ICALP 1984)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 172))

Included in the following conference series:

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. K.R. Apt, M.H. van Emden: Contributions to the theory of logic programming, JACM 29, 3 (1982), pp. 841–862.

    Google Scholar 

  2. A. Arnold, M. Nivat: The metric space of infinite trees. Algebraic and topological properties, Fundamenta Informaticae 3, 4 (1980), pp. 445–476.

    Google Scholar 

  3. E.W. Dijkstra: A discipline of programming, Prentice Hall, (1976).

    Google Scholar 

  4. F. Hausdorff: Set theory, Chelsea Publishing Company, New York (1962).

    Google Scholar 

  5. R.A. Kowalski: Logic for problem solving, Elsevier North Holland, New York, (1979).

    Google Scholar 

  6. R.A. Kowalski, M.H. van Emden: The semantics of logic as a programming language, JACM 23, 4 (1976), pp. 733–742.

    Google Scholar 

  7. J.L. Lassez, M.J. Maher: Closure and fairness in the semantics of logic programming, T.C.S. (to appear).

    Google Scholar 

  8. T. Moto-Oka: Overview of the fifth generation computer project, SIGARCH Newsletter 11(3), 1983, pp. 417–422.

    Google Scholar 

  9. M.A. Nait-Abdallah, M.H. van Emden: Algorithm theory and logic programming, (draft manuscript).

    Google Scholar 

  10. J.A. Robinson: A machine-oriented logic based on the resolution principle, JACM 12, 1 (1965), pp. 23–41.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Waterloo, N2L 3G1, Waterloo, Ontario, Canada

    M. A. Nait Abdallah

Authors
  1. M. A. Nait Abdallah
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jan Paredaens

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nait Abdallah, M.A. (1984). On the interpretation of infinite computations in logic programming. In: Paredaens, J. (eds) Automata, Languages and Programming. ICALP 1984. Lecture Notes in Computer Science, vol 172. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-13345-3_32

Download citation

  • DOI: https://doi.org/10.1007/3-540-13345-3_32

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-13345-2

  • Online ISBN: 978-3-540-38886-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation