Implementing finite-domain constraint logic programming on top of a PROLOG-system with delay-mechanism

  • Danny De Schreye
  • Dirk Pollet
  • Johan Ronsyn
  • Maurice Bruynooghe
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 432)


In the past few years, an extensive amount of empirical evidence has proved the practical value of finite-domain constraint logic programming (CLP). Using special CLP-systems, many constraint satisfaction applications have been programmed very quickly and the resulting programs have a good performance. In this paper, we show how to implement a finite-domain CLP on top of a PROLOG-system equipped with a delay mechanism. The advantages are that the language features are easy to implement, the overhead caused both to the underlying PROLOG-system and to the CLP-environment itself are small and that the system is relatively portable.


Logic Program User Program Constraint Problem Constraint Logic Programming Delay Mechanism 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. [Borning et al 89]
    A.Borning, M.Maher, A.Martindale, M.Wilson, Constraint Hierarchies and Logic Programming, in Proc. of the Sixth International Conference on Logic Programming, eds. G.Levi and M.Martelli, 1989, pp.:149–164.Google Scholar
  2. [Bruynooghe et al 89]
    M.Bruynooghe, D.De Schreye, B.Krekels, Compiling Control, J.Logic Programming, 1989 (6), pp.: 135–162.Google Scholar
  3. [Colmerauer 82]
    A.Colmerauer, PROLOG II: Manuel de reference et modele theorique, Technical Report, GIA — Faculte de Science de Luminy, 1982.Google Scholar
  4. [Colmerauer 87]
    A. Colmerauer, Opening the Prolog III Universe, BYTE Magazine, 12(9), 1987, pp.: 177–182.Google Scholar
  5. [Dechter 89]
    R.Dechter, ed., Proc. Workshop on Constraint Problem Solving, IJCAI89, Detroit, 1989.Google Scholar
  6. [De Schreye & Bruynooghe 89]
    D.De Schreye, M.Bruynooghe, The Compilation of Forward Checking Regimes through Meta-interpretation and Transformation, Proc. Workshop on Meta-programming in Logic Programming, MIT-Press, 1989.Google Scholar
  7. [Dincbas et al 88a]
    M.Dincbas, H.Simonis, P.Van Hentenryck, Solving a Cutting-Stock Problem in Constraint Logic Programming, in Proc. of the 5th International Conference on Logic Programming, 1988, pp.: 42–58.Google Scholar
  8. [Dincbas et al 88b]
    M.Dincbas, P.Van Hentenryck, H.Simonis, A.Aggoun, T.Graf, F.Bertheir, The Constraint Logic Programming Language CHIP, in Proc of FGCS88, 1988, pp.: 693–702.Google Scholar
  9. [Graf et al 89]
    T.Graf, P.Van Hentenryck, C.Pradelles, L.Zimmer, Simulation of Hybrid Circuits in Constraint Logic Programming, in Proc. of IJCAI89, 1989, pp.:72–77.Google Scholar
  10. [Jaffar & Lassez 87]
    J.Jaffar, J-L.Lassez, Constraint Logic Programming, in Proc. 14th ACM Principles of Programming Languages Conference, Munich, 1987.Google Scholar
  11. [Jaffar & Michaylov 87]
    J.Jaffar, S.Michaylov, Methodology and implementation of a CLP System, in Proc. of the 4th International Conference on Logic Programming, 1987, pp.: 196–218.Google Scholar
  12. [Naish 86]
    L.Naish, Negation and Control in Prolog, LNCS 238, Springer-Verlag, 1986.Google Scholar
  13. [Thom & Zobel 88]
    J.Thom, J.Zobel, NU-Prolog Reference Manual, Version 1.3, Technical Report 86/10, Machine Intelligence Project, Computer Science Department, University of Melbourne, 1988.Google Scholar
  14. [Van Hentenryck 89]
    P. Van Hentenryck, Constraint Satisfaction in Logic Programming, Logic Programming Series, MIT-Press, Cambridge, 1989.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

  • Danny De Schreye
    • 1
  • Dirk Pollet
    • 1
  • Johan Ronsyn
    • 1
  • Maurice Bruynooghe
    • 1
  1. 1.Department of Computer ScienceKatholieke Universiteit LeuvenHeverleeBelgium

Personalised recommendations