Skip to main content

An overview of the Andorra Kernel Language

  • Conference paper
  • First Online:
Extensions of Logic Programming (ELP 1991)

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

Included in the following conference series:

  • 111 Accesses

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. Reem Bahgat and Steve Gregory. Pandora: Non-deterministic parallel logic programming. In Proceedings of ICLP'89. MIT Press, 1989.

    Google Scholar 

  2. Francisco Bueno and Manuel Hermenegildo. An automatic translation scheme from Prolog to the Andorra Kernel Language. PEPMA Internal Report, March 1991.

    Google Scholar 

  3. Vitor Santos Costa, David H. D. Warren, and Rong Yang. The Andorra-I engine: A parallel implementation of the Basic Andorra model. In Proceedings of ICLP'91. MIT Press, 1991.

    Google Scholar 

  4. Torkel Franzén. Logical aspects of the Andorra Kernel Language. SICS Research Report R91:12, Swedish Institute of Computer Science, 1991.

    Google Scholar 

  5. Seif Haridi and Per Brand. Andorra Prolog, an integration of Prolog and committed choice languages. In Proceedings of FGCS'88, 1988.

    Google Scholar 

  6. Seif Haridi and Sverker Janson. Kernel Andorra Prolog and its computation model. In Proceedings of ICLP'90. MIT Press, 1990.

    Google Scholar 

  7. Sverker Janson and Seif Haridi. Programming paradigms of the Andorra Kernel Language. In Proceedings of the 1991 International Logic Programming Symposium. MIT Press, 1991. (Revised version of SICS Research Report R91:08, to be published).

    Google Scholar 

  8. Michael J. Maher. Logic semantics for a class of committed choice programs. In Proceedings of the Fourth International Conference on Logic Programming. MIT Press, 1987.

    Google Scholar 

  9. Vijay A. Saraswat. Concurrent Constraint Programming Languages. PhD thesis, Carnegie-Mellon University, January 1990.

    Google Scholar 

  10. Kazunori Ueda. Guarded horn clauses. Technical Report TR-103, ICOT, June 1985.

    Google Scholar 

  11. Pascal Van Hentenryck. Constraint Satisfaction in Logic Programming. MIT Press, 1989.

    Google Scholar 

  12. Rong Yang. Solving simple substitution ciphers in Andorra-I. In Proceedings of the Sixth International Conference on Logic Programming. MIT Press, 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

L. -H. Eriksson L. Hallnäs P. Schroeder-Heister

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Franzén, T., Haridi, S., Janson, S. (1992). An overview of the Andorra Kernel Language. In: Eriksson, L.H., Hallnäs, L., Schroeder-Heister, P. (eds) Extensions of Logic Programming. ELP 1991. Lecture Notes in Computer Science, vol 596. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0013607

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55498-1

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics