Extending the TOY System with the ECLiPSe Solver over Sets of Integers
Loading...
Full text at PDC
Publication date
2012
Advisors (or tutors)
Journal Title
Journal ISSN
Volume Title
Publisher
Citations
Exportar
Citation
S. Estévez-Mart ́ın, J. C. Fernández, and F. Sáenz-Pérez. Extending the TOY system with the eclipse solver over sets of integers. In T. Schrijvers and P. Thiemann, editors, Functional and Logic Programming - 11th International Symposium, FLOPS 2012, Kobe, Japan, May 23-25, 2012. Pro- ceedings, volume 7294 of Lecture Notes in Computer Science, pages 120–135. Springer, 2012.
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.