Extending the TOY System with the ECLiPSe Solver over Sets of Integers

Abstract

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 C tailored to the cooperation of three pure domains: the domain of finite sets of integers (FS), the finite domain of integers (FD) and the Herbrand domain (H). We also present the adaptation of the goal-solving calculus CCLNC(C) (Cooperative Constraint Lazy Narrowing Calculus over C) to this particular case, as well as soundness and limited completeness results. An implementation of this cooperation in the CFLP system TOY is presented. Our implementation is based on interprocess communication between TOY and the external solvers for sets of integers and finite domain of ECLiPSe.