A Demand Driven Computation Strategy for Lazy Narrowing
PLILP '93 Proceedings of the 5th International Symposium on Programming Language Implementation and Logic Programming
A lazy narrowing calculus for declarative constraint programming
PPDP '04 Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming
Dealing with incomplete knowledge on CLP(FD) variable domains
ACM Transactions on Programming Languages and Systems (TOPLAS)
Cardinal: A Finite Sets Constraint Solver
Constraints
A new generic scheme for functional logic programming with constraints
Higher-Order and Symbolic Computation
Enhancing set constraint solvers with lexicographic bounds
Journal of Heuristics
Length-lex ordering for set CSPs
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
On the cooperation of the constraint domains ℋ, ℛ, and ℱ in cflp
Theory and Practice of Logic Programming
Integrating Finite Domain and Set Constraints into a Set-based Constraint Language
Fundamenta Informaticae - Advances in Computational Logic (CIL C08)
| Hi-index | 0.00 |
Starting from a computational model for the cooperation of constraint domains in the CFLP context (with lazy evaluation and higher-order functions), we present the theoretical basis for the coordination domain $\mathcal{C}$ tailored to the cooperation of three pure domains: the domain of finite sets of integers ( $\mathcal{FS}$ ), the finite domain of integers ( $\mathcal{FD}$ ) and the Herbrand domain ( $\mathcal{H}$ ). We also present the adaptation of the goal-solving calculus $CCLNC{\mathcal C}$ (Cooperative Constraint Lazy Narrowing Calculus over $\mathcal{C}$ ) to this particular case, as well as soundness and limited completeness results. An implementation of this cooperation in the CFLP system ${\mathcal TOY}$ is presented. Our implementation is based on inter-process communication between ${\mathcal TOY}$ and the external solvers for sets of integers and finite domain of ECLi PSe .