Skip to main content
SpringerLink
Log in

Optimistic and-parallelism in Prolog

  • Conference paper
  • First Online:
Book cover PARLE Parallel Architectures and Languages Europe (PARLE 1987)

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

Abstract

The principle of stream-parallelism is used to discuss a general method for AND-parallelism in executing logic programs written in Prolog. The method is entirely transparent, it delivers solutions in the same order as Prolog, but tries to achieve a higher degree of parallelism than other dynamic methods for clauses containing shared variables.

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.

6. References

  1. Clark, K. and S. Gregory, “PARLOG: Parallel Programming in Logic,” ACM Transactions on Programming Languages and Systems 8(1), pp. 1–49 (January 1986).

    Article  Google Scholar 

  2. Conery, J.S., “The AND/OR Process Model for Parallel Interpretation of Logic Programs,” Technical Report 204, University of California Irvine (1983).

    Google Scholar 

  3. Conery, J.S. and D.F. Kibler, “AND Parallelism and Nondeterminism in Logic Programs,” New Generation Computing 3, pp. 43–70 (1985).

    Google Scholar 

  4. DeGroot, D., “Restricted And-Parallelism,” Proceedings of the International Conference on Fifth Generation Computer Systems, pp. 471–478 (1984).

    Google Scholar 

  5. DeGroot, D. and Jung-Herng Chang, “A Comparison of two And-Parallel Execution Models,” Hardware and Software Components and Architecture for the 5th Generation, AFCET informatique (1985).

    Google Scholar 

  6. Goto, A. and D.H.D. Warren, “An Abstract Prolog Instruction Set,” Technical Note 309, SRI International, Menlo Parc, CA (October 1983).

    Google Scholar 

  7. Nakajima, K., “Evaluation of PSI Micro-interpreter,” ICOT Technical Report 142 (1986).

    Google Scholar 

  8. Seitz, Charles L., “The Cosmic Cube,” Communications of the ACM 28(1), pp. 22–33 (1985).

    Article  Google Scholar 

  9. Shapiro, E.Y., “A Subset of Concurrent Prolog and Its Interpreter,” ICOT Technical Report TR-003, Institute for New Generation Computer Technology, Tokyo (February, 1983).

    Google Scholar 

  10. Stroustrup, B., “A Set of C Classes for Co-routine Style Programming,” Bell Laboratories Computing Science Technical Report No 90 (July, 1982).

    Google Scholar 

  11. Tick, E. and D.H.D. Warren, “Towards a Pipelined Prolog Processor,” Proc. of the 1984 International Symposium on Logic Programming, pp. 29–42 (February 6–9, 1984).

    Google Scholar 

  12. Ueda, K., “Guarded Horn Clauses,” ICOT Technical Report 103 (1985).

    Google Scholar 

  13. Warren, D.H.D., “Implementing Prolog — compiling predicate logic programs,” D.A.I. Research Report No. 39 & 40 (May, 1977).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Mathematics and Computer Science, Vrije Universiteit, P.O. Box 7161, Amsterdam

    Hans Tebra

Authors
  1. Hans Tebra
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. W. de Bakker A. J. Nijman P. C. Treleaven

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tebra, H. (1987). Optimistic and-parallelism in Prolog. In: de Bakker, J.W., Nijman, A.J., Treleaven, P.C. (eds) PARLE Parallel Architectures and Languages Europe. PARLE 1987. Lecture Notes in Computer Science, vol 259. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-17945-3_24

Download citation

  • DOI: https://doi.org/10.1007/3-540-17945-3_24

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-17945-0

  • Online ISBN: 978-3-540-47181-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation