Abstract
We present CFLP(FD), a constraint functional logic programming approach over finite domains (FD) for solving typical combinatorial problems. Our approach adds to former approaches as Constraint Logic Programming (CLP), and Functional Logic Programming (FLP) both expressiveness and further efficiency by combining combinatorial search with propagation. We integrate FD constraints into the functional logic language TOY. CFLP(FD) programs consist of TOY rules with FD constraints declared as functions. CFLP(FD) seamlessly combines the power of CLP over FD with the higher order characteristics of FLP.
The work of this author was partially supported by the project TIC2001-2705-C03-02 funded by the Spanish Ministry of Science and Technology.
The work of these authors has been supported by the Spanish project PR 48/01-9901 funded by UCM.
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
N. Beldiceanu. Global Constraints as Graph Properties on a Structured Net-work of Elementary Constraints of the Same Type. 6th International Conference on Principles and Practice of Constraint Programming, Springer LNCS 1894, pp:52–66, Singapore, 2000.
M. Carsson, G. Ottosson and B. Carlson. An Open-Ended Finite Domain Constraint Solver. 9th International Symposium on Programming Languages: Implementations, Logics and Programs, Springer LNCS 1292, pp:191-206, Southampton, 1997.
R. Fourer, D. M. Gay and B. W. Kernighan. AMPL: A Modeling Language for Mathematical Programming. Scientific Press, 1993.
A.J. Fernández, T. Hortalá-González and F. Sáenz-Pérez. TOY(FD): User Manual, latest version, July, 2002. Available athttp://wv.lcc.uma.es/~afdez/cf lpf d/.
M. Hanus. The Integration of Functions into Logic Programming: A Survey. The Journal of Logic Programming (Special issue “Ten Years of Logic Programming”), 19–20:583-628, 1994.
P. Van Hentenryck. Constraint Satisfaction in Logic Programming. The MIT Press, 1989.
P. Van Hentenryck. The OPL Optimization Programming Language. The MIT Press. 1999.
T. Hortalá-González and F. Sáenz-Pérez. Interfacing a Functional Logic Language with a Finite Domain Solver. 11th International Workshop on Functional and (Constraint) Logic Programming, Grado, Italy, 2002.
J. Jaffar and M.J. Maher. Constraint Logic Programming: A Survey. The Journal of Logic Programming, 19 /20: 503–582, 1994.
F.J. López-Fraguas and J. Sanchez-Hernández. TOY: A Multiparadigm Declarative System. 10th International Conference on Rewriting Techniques and Applications, Springer LNCS 1631, pp. 244–247, Trento, 1999. The system and further documentation including programming examples is available athttp://babel.dacya.ucm.es/toy and http://titan.sip.ucm.es/toy.
M. Rodríguez-Artalejo. Functional and Constraint Logic Programming. Constraints in Computational Logics, Springer LNCS 2002, pp. 202-270, 2001.
N.F. Zhou, Channel Routing with Constraint Logic Programming and Delay. 9th International Conference on Industrial Applications of Artificial Intelligence, pp. 217–231, Gordon and Breach Science Publishers, 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag London Limited
About this paper
Cite this paper
Fernández, A.J., Hortalá-González, T., Sáenz-Pérez, F. (2003). A Constraint Functional Logic Language for Solving Combinatorial Problems. In: Bramer, M., Preece, A., Coenen, F. (eds) Research and Development in Intelligent Systems XIX. Springer, London. https://doi.org/10.1007/978-1-4471-0651-7_24
Download citation
DOI: https://doi.org/10.1007/978-1-4471-0651-7_24
Publisher Name: Springer, London
Print ISBN: 978-1-85233-674-5
Online ISBN: 978-1-4471-0651-7
eBook Packages: Springer Book Archive