Skip to main content
SpringerLink
Log in

Implementing a finite-domain CLP-language on top of Prolog: a transformational approach

  • Conference paper
  • First Online:
Logic Programming and Automated Reasoning (LPAR 1994)

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

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. Frédéric Benhamou and William Older. Applying Interval Arithmetic to Integer and Boolean Constraints. Technical report, Bell Northern Research, 1992.

    Google Scholar 

  2. Bart Van Den Bosch. Implementation of a clp library and an application in nurse scheduling. Master's thesis, Katholieke Universiteit Leuven, 1993.

    Google Scholar 

  3. Maurice Bruynooghe. Second International Workshop on Meta-programming in Logic, 1990. Leuven, Belgium.

    Google Scholar 

  4. Maurice Bruynooghe and Danny De Schreye. Meta-interpretation. In S. C. Shapiro, editor, Encyclopedia of Artificial Intelligence, pages 939–940. John Wiley & Sons, Inc, 1992.

    Google Scholar 

  5. Danny De Schreye, D. Pollet, J. Ronsyn, and Maurice Bruynooghe. Implementing finite-domain constraint logic programming on top of a prolog-system with a delay mechanism. In N. Jones, editor, proceedings of ESOP90, LNCS 432, pages 106–117. Springer-Verlag, 1990.

    Google Scholar 

  6. Daniel Diaz and Philippe Codognet. A minimal extention of the WAM for clp(fd). In Davis S. Warren, editor, Proceedings of the Tenth International Conference on Logic Programming. pages 774–790, 1993.

    Google Scholar 

  7. ECRC. ECLIPSE 3.4, Extensions User Manual., 1994.

    Google Scholar 

  8. Pascal Van Hentenryck. Constraint Satisfaction in Logic Programming. The MIT press, 1989.

    Google Scholar 

  9. Pascal Van Hentenryck and Yves Deville. The cardinality operator: A new logical connective for constraint logic programming. In proceedings of ICLP, 1991.

    Google Scholar 

  10. Pascal Van Hentenryck, Vijay Saraswat, and Yves Deville. Constraint processing in cc(FD). Brown University, 1992.

    Google Scholar 

  11. IBM. IBM SAA AD/Cycle Prolog/2 Language Reference, Release 1, 1992.

    Google Scholar 

  12. Alan K. Mackworth. Consistency in networks of relations. Artificial Intelligence, 8:99–118, 1977.

    Google Scholar 

  13. Bernard A. Nadel. Constraint satisfaction algorithms. Computational Intelligence, 5(4):188–224, November 1989.

    Google Scholar 

  14. Prolog IA. Prolog III Reference Manual, December 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, K. U. Leuven, Celestijnenlaan 200A, B-3001, Heverlee, Belgium

    Henk Vandecasteele & Danny de Schreye

Authors
  1. Henk Vandecasteele
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Danny de Schreye
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Frank Pfenning

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Vandecasteele, H., de Schreye, D. (1994). Implementing a finite-domain CLP-language on top of Prolog: a transformational approach. In: Pfenning, F. (eds) Logic Programming and Automated Reasoning. LPAR 1994. Lecture Notes in Computer Science, vol 822. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58216-9_31

Download citation

  • DOI: https://doi.org/10.1007/3-540-58216-9_31

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58216-8

  • Online ISBN: 978-3-540-48573-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation