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

  • Henk Vandecasteele
  • Danny de Schreye
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 822)


program transformation Constraint Logic Programming finite domains 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 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. 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. 3.
    Maurice Bruynooghe. Second International Workshop on Meta-programming in Logic, 1990. Leuven, Belgium.Google Scholar
  4. 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. 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. 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. 7.
    ECRC. ECLIPSE 3.4, Extensions User Manual., 1994.Google Scholar
  8. 8.
    Pascal Van Hentenryck. Constraint Satisfaction in Logic Programming. The MIT press, 1989.Google Scholar
  9. 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. 10.
    Pascal Van Hentenryck, Vijay Saraswat, and Yves Deville. Constraint processing in cc(FD). Brown University, 1992.Google Scholar
  11. 11.
    IBM. IBM SAA AD/Cycle Prolog/2 Language Reference, Release 1, 1992.Google Scholar
  12. 12.
    Alan K. Mackworth. Consistency in networks of relations. Artificial Intelligence, 8:99–118, 1977.Google Scholar
  13. 13.
    Bernard A. Nadel. Constraint satisfaction algorithms. Computational Intelligence, 5(4):188–224, November 1989.Google Scholar
  14. 14.
    Prolog IA. Prolog III Reference Manual, December 1991.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Henk Vandecasteele
    • 1
  • Danny de Schreye
    • 1
  1. 1.Department of Computer ScienceK. U. LeuvenHeverleeBelgium

Personalised recommendations