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 \(\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 ECLiPSe.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Azevedo, F.: Cardinal: A finite sets constraint solver. Constraints 12, 93–129 (2007)
Bergenti, F., Dal Palú, A., Rossi, G.: Integrating finite domain and set constraints into a set-based constraint language. Fundam. Inf. 96, 227–252 (2009)
ECLiPSe Web Site, http://eclipseclp.org/
Estévez, S., Fernández, A.J., Sáenz, F.: Cooperation of the Finite Domain and Set Solvers in \(\mathcal{TOY}\). In: Lucio, P., Moreno, G., Peña, R. (eds.) Proc. Prole 2009, Spain, pp. 217–226 (2009)
Estévez-Martín, S., Fernández, A.J., Hortalá-González, T., Rodríguez-Artalejo, M., Sáenz-Pérez, F., del Vado Vírseda, R.: On the Cooperation of the Constraint Domains \(\mathcal{H}\), \(\mathcal{R}\) and \(\mathcal{FD}\) in CFLP. TPLP 9, 415–527 (2009)
Fernández, A.J., Hill, P.M.: An interval constraint branching scheme for lattice domains. J. UCS 12(11), 1466–1499 (2006)
Gavanelli, M., Lamma, E., Mello, P., Milano, M.: Dealing with incomplete knowledge on clp(fd) variable domains. ACM Trans. Program. Lang. Syst. 27, 236–263 (2005)
Gervet, C., Van Hentenryck, P.: Length-lex ordering for set csps. In: AAAI (2006)
Loogen, R., López-Fraguas, F., Rodríguez-Artalejo, M.: A Demand Driven Computation Strategy for Lazy Narrowing. In: Penjam, J., Bruynooghe, M. (eds.) PLILP 1993. LNCS, vol. 714, pp. 184–200. Springer, Heidelberg (1993)
López-Fraguas, F., Rodríguez-Artalejo, M., del Vado-Virseda, R.: A Lazy Narrowing Calculus for Declarative Constraint Programming. In: PPDP 2004, pp. 43–54. ACM Press (2004)
López-Fraguas, F., Rodríguez-Artalejo, M., del Vado Vírseda, R.: A new generic scheme for functional logic programming with constraints. Higher-Order and Symbolic Computation 20(1/2), 73–122 (2007)
Sadler, A., Gervet, C.: Hybrid Set Domains to Strengthen Constraint Propagation and Reduce Symmetries. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 604–618. Springer, Heidelberg (2004)
Sadler, A., Gervet, C.: Enhancing set constraint solvers with lexicographic bounds. Journal of Heuristics 14(1), 23–67 (2008)
Toy Web Site, http://toy.sourceforge.net/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Estévez-Martín, S., Correas Fernández, J., Sáenz-Pérez, F. (2012). Extending the \(\mathcal{TOY}\) System with the ECLiPSe Solver over Sets of Integers. In: Schrijvers, T., Thiemann, P. (eds) Functional and Logic Programming. FLOPS 2012. Lecture Notes in Computer Science, vol 7294. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29822-6_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-29822-6_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-29821-9
Online ISBN: 978-3-642-29822-6
eBook Packages: Computer ScienceComputer Science (R0)