Skip to main content
SpringerLink
Log in

The Pandora abstract machine: An extension of JAM

  • Conference paper
  • First Online:
Parallel Execution of Logic Programs (PLP 1991)

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

Included in the following conference series:

Abstract

Combining stream and-parallelism and don't-know non-determinism in a unified logic programming language introduces new difficulties which affect both the language design and implementation. Nevertheless, recent work suggests that it may be feasible to tackle these problems. A language called Pandora was recently introduced, which extends Parlog with a deadlock handling mechanism and a “lazy” form of don't-know non-determinism. In this paper, we present an abstract machine for Pandora targetted towards a shared memory multiprocessor architecture. It is based on the JAM: an abstract machine for committed-choice languages, and modifies it to support features of Pandora that are not in Parlog.

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. Bahgat, R.M.R. 1991. Pandora: non-deterministic parallel logic programming. PhD thesis, Dept of Computing, Imperial College, London University.

    Google Scholar 

  2. Costa, V.S.; Warren, D.H.D. and Yang, R. 1991. ‘The Andorra-I engine: a parallel implementation of the basic Andorra model'. In Proceedings of the eighth International Conference on Logic Programming, Paris.

    Google Scholar 

  3. Crammond, J.A. 1990. ‘The Abstract machine and implementation of parallel Parlog'. Research Report, Dept. of Computing, Imperial College, University of London.

    Google Scholar 

  4. Gregory, S. 1987. Parallel logic programming in Parlog: the language and its implementation. Reading, Massachusetts: Addison-Wesley.

    Google Scholar 

  5. Haridi, S. and Janson, S. 1990. ‘Kernel Andorra Prolog and its computation model'. In Proceedings of the seventh International Conference on Logic Programming, Jerusalem, pp.31–46.

    Google Scholar 

  6. Leung, H-F. 1991. ‘Distributed Implementation of Pandora'. Research Report, Dept. of Computing, Imperial College, London University.

    Google Scholar 

  7. Warren, D.H.D. 1983. ‘An abstract Prolog instruction set'. Technical Note 309, SRI International, Menlo Park, CA. (October 1983).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, City University, Northampton Square, EC1V OHB, London, England

    Reem Bahgat

Authors
  1. Reem Bahgat
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

A. Beaumont G. Gupta

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bahgat, R. (1991). The Pandora abstract machine: An extension of JAM. In: Beaumont, A., Gupta, G. (eds) Parallel Execution of Logic Programs. PLP 1991. Lecture Notes in Computer Science, vol 569. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55038-0_7

Download citation

  • DOI: https://doi.org/10.1007/3-540-55038-0_7

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55038-9

  • Online ISBN: 978-3-540-46673-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation