Integrating Finite Domain Constraints and CLP with Sets


In this paper we propose a semantically well-founded combination of the constraint solvers used in the constraint programming languages CLP (SET) and CLP(ℱD). This work demonstrates that it is possible to provide efficient executions (through CLP (ℱD) solvers) while maintaining the expressive power and flexibility of the CLP(SET) language. We develop a combined constraint solver and we show how static analysis can help in organizing the distribution of constraints to the two constraint solvers.

Proceedings of the 5th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming