Skip to main content
SpringerLink
Log in

Abstract complexity of prolog based on WAM

  • Invited Talk
  • Conference paper
  • First Online:
Progamming Language Implementation and Logic Programming (PLILP 1993)

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

Abstract

Simple definitions of time and space complexity measures of Prolog programs based on an abstraction of Warren Abstract Machine instructions set is suggested. Its effect is discussed on practical measuring time and space consumption, complexity classifications and optimization of programs.

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. Ait-Kaci, H.: Warren's Abstract Machine. A Tutorial Reconstruction. The MIT Press, 1991.

    Google Scholar 

  2. Appleby, K., Carlsson, M., Haridi, S., Sahlin, D.: Garbage collection for Prolog based on WAM. Communications of the ACM, v.31, n.6, (June 1988), 719–741.

    Google Scholar 

  3. Bruynooghe, M.: The memory management of Prolog implementations. in: Logic Programming, (N.Y, Academic Press, 1982) 193–210.

    Google Scholar 

  4. Debray, S.K., Lin, Nai-Wei.: Automatic Complexity Analysis of Logic Programs. In: Logic Programming. Proc. of the 8th Intern. Conf. (K.Furikawa Ed.), 1991.

    Google Scholar 

  5. Dikovsky, A.Ja.: Space considerations in Prolog. in: Meyer, A.R. Taitslin,M.A. ed., Proc. of the Symp. on Logical Foundations of Comput. Sci. ”Logic at Botik'89”, (Springer-Verlag, 1989), 101–107.

    Google Scholar 

  6. Dikovsky, A.Ja.: On computational complexity of Prolog programs. Theoretical Computer Science, 1993, in press.

    Google Scholar 

  7. Lewis, H.R.: Complexity results for classes of quantificational formulas. J.Comput. and Syst. Sci., 21 (1980), 317–353.

    Google Scholar 

  8. Lloyd, J.W.: Foundations of logic programming. Springer-Verlag, Berlin, Heidelberg, New York, Tokyo (1984).

    Google Scholar 

  9. Tick, E. Warren, D.H.D.: Towards a pipelined Prolog processor. New Generation Computing, 2 (1984) 323–345.

    Google Scholar 

  10. Warren, D.H.D.: An improved Prolog implementation which optimizes tail recursion. in: Tarnlund, S.A. ed.,Proc. of the Logic Programming Workshop, (Debrecen, Hungary, 1980).

    Google Scholar 

  11. Warren, D.H.D.: An abstract Prolog instruction set.-Tech. note 309, SRI Intern. Menlo Park, CA, October 1983.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Russian Academy Inst. for Applied Mathematics, 4, Miusskaja sq., 125047, Moscow, Russia

    Alexander Ja. Dikovsky

Authors
  1. Alexander Ja. Dikovsky
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Maurice Bruynooghe Jaan Penjam

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dikovsky, A.J. (1993). Abstract complexity of prolog based on WAM. In: Bruynooghe, M., Penjam, J. (eds) Progamming Language Implementation and Logic Programming. PLILP 1993. Lecture Notes in Computer Science, vol 714. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57186-8_91

Download citation

  • DOI: https://doi.org/10.1007/3-540-57186-8_91

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57186-5

  • Online ISBN: 978-3-540-47945-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation