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

Abstract. 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