Skip to main content
SpringerLink
Log in
Book cover

International Conference on Logic for Programming Artificial Intelligence and Reasoning

LPAR 1992: Logic Programming and Automated Reasoning pp 160–171Cite as

Reform compilation for nonlinear recursion

  • Session 7: Implementation Aspects
  • Conference paper
  • First Online:

  • 128 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 624))

Abstract

We present a method for compiling nonlinear recursion in logic programming to parallel iteration (for-loops). The method results in less unification work and fewer procedure calls than implementations of SLD-resolution. The principal restriction is that the recursion depth of the computation must depend only on the size of the input arguments.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Barklund, J. Parallel Unification, Ph.D. Thesis, Computing Science Dept., Uppsala University, 1990.

    Google Scholar 

  2. Clark, K.L. Negation as failure, Logic and Data Bases (eds. H. Gallaire & J. Minker), Plenum Press, 1978.

    Google Scholar 

  3. Millroth, H. Reforming Compilation of Logic Programs, Ph.D. Thesis, Computing Science Dept., Uppsala University, 1990. (Summary in: Proc. Int. Logic Programming Symp., San Diego, CA., October 1991)

    Google Scholar 

  4. Robinson, J. A. A machine-oriented logic based on the resolution principle. Journal of the ACM 12 (1965), 23–41.

    Article  Google Scholar 

  5. Tärnlund, S.-Å. Reform, report, Uppsala University.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computing Science Dept., Uppsala University, Box 520, S-751 20, Uppsala, Sweden

    Håkan Millroth

Authors
  1. Håkan Millroth
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Andrei Voronkov

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Millroth, H. (1992). Reform compilation for nonlinear recursion. In: Voronkov, A. (eds) Logic Programming and Automated Reasoning. LPAR 1992. Lecture Notes in Computer Science, vol 624. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0013058

Download citation

  • DOI: https://doi.org/10.1007/BFb0013058

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-47279-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation