Skip to main content

A WAM-based implementation of a logic language with sets

  • 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

The paper analyzes an approach for integrating set theoretical constructs into a logic programming language. The focus is on describing a new abstract machine, based on the classical WAM, designed to support these new features. A major part of the paper concentrates on the implementation of the new unification algorithm and the set-constraints management support

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ambert F. (1991) “Systemes de Resolution de Constraintes Ensemblistes”-Research Report, Université de Franche-Comte, Faculté des Sciences de Besançon.

    Google Scholar 

  2. Ait-Kaci H. (1990) “The WAM: A (Real) Tutorial”-DEC Technical Report, January 1990.

    Google Scholar 

  3. Apt K., Blair H., Walker A. (1987) “Towards a theory of declarative knowledge”-in (J. Minker ed.) Foundations of deductive databases and Logic Programming, Morgan Kaufmann, Los Altos, CA.

    Google Scholar 

  4. Beeri C., Naqvi S., et al. (1987)-“Set and Negation in a Logic Database Language (LDL1)”-Proceedings of the 6th ACM SIGMOD Symposium.

    Google Scholar 

  5. Campbell J. A. (1984)-“Implementations of Prolog”-J. Wiley & Sons.

    Google Scholar 

  6. Cantone D., Ferro A., Omodeo E.G. (1989) “Computable Set Theory”-International Series of Monographs on Computer Science, Oxford Press.

    Google Scholar 

  7. Carlsson M. (1991) “The SICStus Emulator”-SICS Technical Report T91:15, Swedish Institute of Computer Science.

    Google Scholar 

  8. Cavalieri M., Lamma E., Mello P. (1988)-“Warren Abstract Machine: una macchina astratta per l'implementazione efficiente di Prolog”-Technical Report, Universitá degli Studi di Bologna, March 1988.

    Google Scholar 

  9. Conery J.S. (1987)-“Parallel Execution of Logic Programming”-Kluwer Academic Publishers.

    Google Scholar 

  10. Dovier A., Omodeo E.G., Pontelli E., Rossi G. (1991)-“(Log): A Logic Programming Language with Finite Sets”-in Logic Programming: Proceedings of the 8th International Conference, MIT Press.

    Google Scholar 

  11. Dovier A., Omodeo E.G., Pontelli E., Rossi G. (1992)-“Embedding Finite Sets in a Logic Programming Language”-Third Workshop on Extensions of Logic Programming, LNCS 660 (E.Lamma, P.Mello eds). Springer Verlag.

    Google Scholar 

  12. Dovier A., Omodeo E.G., Pontelli E., Rossi G. (1993) “Embedding Finite Sets in a Logic Programming Language”-Research Report, University of Rome, La Sapienza.

    Google Scholar 

  13. Dincbas M., Van Hentenryck P., et al. (1988)-“The Constraint Logic Programming Language CHIP”-Proceedings of the International Conference on Fifth Generation Computer Systems, ICOT, Tokyo.

    Google Scholar 

  14. Gabriel J., Lindholm T., Lusk E.L., Overbeek R.A. (1985)-“A tutorial on the Warren Abstract Machine for Computational Logic”-Technical Report ANL84-84, Argonne National Laboratory.

    Google Scholar 

  15. Hermenegildo M., Greene K. (1991) “The &-Prolog System: exploiting Independent And-Parallelism”-in New Generation Computing, 9(34).

    Google Scholar 

  16. Holldobler S. (1989) “Foundations of Equational Logic Programming”-LNCS 353, Springer Verlag.

    Google Scholar 

  17. Jaffar J., Lassez J.L. (1987)-“Constraint Logic Programming”-14th POPL, Munich.

    Google Scholar 

  18. Jaffar J., Michaylov S. (1987)-“Methodology and Implementation of a CLP System”-Proceedings of the 4th International Conference on Logic Programming, MIT Press.

    Google Scholar 

  19. Karlsson R. (1992) “A high Performace OR-Parallel Prolog System”-PhD Thesis, SICS Dissertation Series 07.

    Google Scholar 

  20. Kursawe P. (1987)-“How to invent a Prolog machine”-in New Generation Computing, 5 (1987).

    Google Scholar 

  21. Legeard B., Legros E. (1991)-“CLPS: A set constraints logic programming language”-Technical Report, Universitè de Besançon.

    Google Scholar 

  22. Nadathur G., Jayaraman B. (1989)-“Towards a WAM Model for λProlog”-Technical Report CS-1989, Duke University.

    Google Scholar 

  23. Pontelli E. (1992)-“Logic Programming with Sets: Theory and Implementation”-MSC Thesis, University of Houston, Houston, TX.

    Google Scholar 

  24. Schwartz J.T., Dewar R.B.K., Dubinsky E., Schonberg E. (1986) “Programming with sets, an introduction to SETL”-Springer Verlag.

    Google Scholar 

  25. Van Hentenryck P. (1989)-“Constraint Satisfaction in Logic Programming”-MIT Press, Cambridge.

    Google Scholar 

  26. Warren H.D. (1983) “An Abstract Prolog Instruction Set”-Technical Note 309, SRI International, Menlo Park, CA.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

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

Dovier, A., Pontelli, E. (1993). A WAM-based implementation of a logic language with sets. 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_85

Download citation

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

  • 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