Constraint functional logic programming over finite domains

Theory and Practice of Logic Programming

Volumn 7, Issue 5, 2007, Pages 537-582

  Fernández, Antonio J ^a   Hortalá Gonzálezt, Teresa ^b   Sáenz Pérez, Fernando ^b   Del Vado Vírseda, Rafael ^b  

^a UNIVERSITY OF MÁLAGA   (Spain)

^b UNIVERSIDAD COMPLUTENSE DE MADRID   (Spain)

Author keywords

Constraint logic programming; Finite domains; Functional logic programming

Indexed keywords

CONSTRAINT THEORY; FUNCTIONAL PROGRAMMING; SEMANTICS;

CONSTRAINT LOGIC PROGRAMMING; FINITE DOMAINS; FUNCTIONAL LOGIC PROGRAMMING;

LOGIC PROGRAMMING;

EID: 34548274892     PISSN: 14710684     EISSN: 14753081     Source Type: Journal    
DOI: 10.1017/S1471068406002924     Document Type: Article

References (57)

1. AÏT-KACI, H. AND POELSKI, A. 1993. Towards a meaning of LIFE. Journal of Logic Programming 16, 3, 195-234. A preliminary version appeared in Maluszynski and Wirsing (1991), pp. 255-274.
2. ANTOY, S. 1992. Definitional trees. In 3rd International Conference on Algebraic and Logic Programming (ALP'92). Number 632 in LNCS. Springer-Verlag, Volterra, Italy, 143-157.
3. ANTOY, S., ECHAHED, R., AND HANUS, M. 2000. A needed narrowing strategy. J. ACM 47, 4, 776-822.
4. ANTOY, S. AND HANUS, M. 2000. Compiling multi-paradigm declarative programs into prolog. In 3rd International Workshop on Frontiers of Combining Systems (FroCoS'2000), H. Kirchner and C. Ringeissen, Eds. Number 1794 in LNCS. Springer, Nancy, France, 171-185.
5. APT, K. 2003. Principles of constraint programming. Cambridge University Press.
6. ARENAS, P., HORTALA, M., LÓPEZ- FRAGUAS, F., AND ULLÁN, E. 1996. Real constraints within a functional logic language. In Joint Conference on Declarative Programming (APPIA-GULP-PRODE'96), P. Lucio, M. Martelli, and M. Navarro, Eds. Donostia-San Sebastian, Spain.
7. BARNIER, N. AND BRISSET, P. 2001. FaCiLe: a functional constraint library. ALP Newsletter 14, 2 (May).
8. CABALLERO, R., LÓPEZ-FRAGUAS, F., AND SÁNCHEZ, J. 1997. User's manual for F OY. Technical report SIP-5797, Universidad Complutense de Madrid, Dpto. Lenguajes, Sistemas Informáticos y Programación.
9. CARLSSON, M., OTTOSSON, G., AND CARLSON, B. 1997. An open-ended finite domain constraint solver. In 9th International Symposium on Programming Languages: Implementations, Logics and Programs (PLILP'97), U. Montanari and F. Rossi, Eds. Number 1292 in LNCS. Springer-Verlag, Southampton, UK, 191-206.
10. CODOGNET, P. AND DIAZ, D. 1996. Compiling constraints in clp(FD). The Journal of Logic Programming 27, 3, 185-226.
11. DAMAS, L. AND MILNER, R. 1982. Principal type-schemes for functional programs. In Ninth ACM Symposium on Principles of Programming Languages (POPL'82). ACM Press, Albuquerque, New Mexico, 207-212.
12. DARLINGTON, J., GUO, Y., AND PULL, H. 1992. A new perspective on the integration of functional and logic languages. In International Conference on Fifth Generation Computer Systems (FGCS'92), I. Staff, Ed. IOS Press, Tokyo, Japan, 682-693.
13. DECHTER, R. 2003. Constraint processing. Morgan Kaufmann.
14. DEL VADO-VÍRSEDA, R. 2003. A demand-driven narrowing calculus with overlapping definitional trees. In ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP'03). ACM Press, Uppsala, Sweden, 213-227.
15. DEL VADO-VÍRSEDA, R. 2005. Declarative constraint programming with definitional trees. In 5th International Workshop on Frontiers of Combining Systems (FroCoS'05). Lecture Notes in Computer Science, vol. 3717. Springer, Vienna, Austria, 184-199.
16. DIAZ, D. AND CODOGNET, P. 2001. Design and implementation of the GNU prolog system. Journal of Functional and Logic Programming 2001, 6 (October).
17. DINCBAS, M., SIMONIS, H., AND VAN HENTENRYCK, P. 1988. Solving the car-sequencing problem in constraint logic programming. In 8th European Conference on Artificial Intelligence (ECAI'88), Y. Kodratoff, Ed. Pitmann Publishing, London, Munich, Germany, 290-295.
18. ESTÉVEZ-MARTÍN, S. AND DEL VADO-VÍRSEDA, R. 2005. Designing an efficient computation strategy in cflp(F D) using definitional trees. In 2005 ACM SIGPLAN workshop on Curry and functional logic programming (WCFLP '05). ACM Press, New York, NY, USA, 23-31.
19. FERNÁNDEZ, A. J., HORTALÁ- GONZÁLEZ, M. T., AND SÁENZ-PÉREZ, F. 2002. A constraint functional logic language for solving combinatorial problems. In Research and Development in Intelligent Systems XIX, A. P. M. Bramer and F. Coenen, Eds. BCS Conference Series. Springer-Verlag, Cambridge, England, 337-350.
20. FERNÁNDEZ, A. J., HORTALÁ- GONZÁLEZ, M. T., AND SÁENZ-PÉREZ, F. 2003. Solving combinatorial problems with a constraint functional logic language. In 5th International Symposium on Practical Aspects of Declarative Languages (PADL'2003), P. Wadler and V. Dahl, Eds. Number 2562 in LNCS. Springer-Verlag, New Orleans, Louisiana, USA, 320-338.
21. FERNÁNDEZ, A. J., HORTALÁ- GONZÁLEZ, T., AND SÁENZ-PÉREZ, F. 2004. TOY(FD): System, Sources and user manual. Available at http://toy.sourceforge.net/.
22. FERNÁNDEZ, M. 1992. Narrowing based procedures for equational disunification. Applicable Algebra in Engineering Communication and Computing 3, 1-26.
23. FOURER, R., GAY, D., AND KERNIGHAN, B. 1993. AMPL: A modeling language for mathematical programming. Scientific Press.
24. FRÜHWIRTH, T. AND ABDENNADHER, S. 2003. Essentials of constraint programming. Cognitive Technologies Series. Springer.
25. GNU PROLOG. 2005. http://pauillac.inria.fr/~diaz/gnu-prolog/.
26. GONZÁLEZ-MORENO, J., HORTALÁ- GONZÁLEZ, M., LÓPEZ-FRAGUAS, F., AND RODRÍGUEZ-ARTALEJO, M. 1999a. An approach to declarative programming based on a rewriting logic. The Journal of Logic Programming 40, 1 (July), 47-87.
27. GONZÁLEZ-MORENO, J., HORTALÁ- GONZÁLEZ, M., AND RODRÍGUEZ- ARTALEJO, M. 1999b. Polymorphic types in functional logic programming. In 4th International Symposium on Functional and Logic Programming (FLOPS'99), A. Middeldorp and T. Sato, Eds. Number 1722 in LNCS. Springer-Verlag, Tsukuba, Japan, 1-20. Also published in a special issue of the Journal of Functional and Logic Programming, 2001. See http://danae.uni- muenster.de/lehre/kuchen/JFLP.
28. GUNTER, C. AND SCOTT, D. 1990. Semantic domains. In Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics, J. van Leeuwen, Ed. Elsevier and The MIT Press, 633-674.
29. HANUS, M. 1994. The integration of functions into logic programming: a survey. The Journal of Logic Programming 19-20, 583-628. Special issue: Ten Years of Logic Programming.
30. HANUS, M. 1999. Curry: a truly integrated functional logic language. http://www.informatik.uni-kiel.de/~curry/.
31. HANUS M. (EDITOR). 2005. PAKCS 1.7.1, User manual (version of December 2005). The Portland Aachen Kiel Curry System. Available from http://www.informatik.uni-kiel.de/~pakcs/.
32. HARALICK, R. AND ELLIOT, G. 1980. Increasing tree search efficiency for constraint satisfaction problems. Artificial Intelligence 14, 263-313.
33. HENZ, M. AND MÜLLER, T. 2000. An overview of finite domain constraint programming. In 5th Conference of the Association of Asia-Pacific Operational Research Societies. Singapore.
34. JAFFAR, J. AND MAHER, M. 1994. Constraint logic programming: a survey. The Journal of Logic Programming 19-20, 503-581.
35. LOOGEN, R., LÓPEZ-FRAGUAS, F. J., AND RODRÍGUEZ-ARTALEJO, M. 1993. A demand driven computation strategy for lazy narrowing. In 5th International Symposium on Programming Language Implementation and Logic Programming PLILP'93, M. Bruynooghe and J. Penjam, Eds. Lecture Notes in Computer Science, vol. 714. Springer, Tallinn, Estonia, 184-200.
36. LÓPEZ-FRAGUAS, F. 1992. A general scheme for constraint functional logic programming. In 3rd International Conference on Algebraic and Logic Programming (ALP'92), H. Kirchner and G. Levi, Eds. Number 632 in LNCS. Springer-Verlag, Volterra, Italy, 213-227.
37. LÓPEZ-FRAGUAS, F., RODRÍGUEZ- ARTALEJO, M., AND DEL VADO- VÍRSEDA, R. 2004a. Constraint functional logic programming revisited. In 5th International Workshop on Rewriting Logic and its Applications (WRLA'2004). Barcelona, Spain. An extended and revised version has also been published in Elsevier ENTCS series 117:5-50, 2005.
38. LÓPEZ-FRAGUAS, F., RODRÍGUEZ- ARTALEJO, M., AND DEL VADO- VÍRSEDA, R. 2004b. A lazy narrowing calculus for declarative constraint programming. In 6th ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming (PPDP'04). ACM Press, Verona, Italy, 43-54.
39. LÓPEZ-FRAGUAS, F. AND SÁNCHEZ-HERNÁNDEZ, J. 1999. F OY: A multiparadigm declarative system. In 10th International Conference on Rewriting Techniques and Applications, P. Narendran and M. Rusinowitch, Eds. Number 1631 in LNCS. Springer-Verlag, Trento, Italy, 244-247.
40. LUX, W. 2001. Adding linear constraints over real numbers to Curry. In 5th International Symposium on Functional and Logic Programming (FLOPS'2001), A. Middeldorp, H. Kuchen, and K. Ueda, Eds. Number 2024 in LNCS. Springer-Verlag, Tokyo, Japan, 185-200.
41. MALUSZYNSKI, J. AND WIRSING, M., Eds. 1991. Programming Language Implementation and Logic Programming, 3rd International Symposium, PLILP'91, Passau, Germany, August 26-28, 1991, Proceedings. Lecture Notes in Computer Science, vol. 528. Springer.
42. MARIN, M. 2000. Functional logic programming with distributed constraint solving. Ph.D. thesis, Research Institute for Symbolic Computation (RISC), Johannes Kepler University, Linz.
43. MARIN, M., IDA, T., AND SCHREINER, W. 1999. CFLP: a mathematica implementation of a distributed constraint solving system. In 3rd International Mathematical Symposium (IMS'99). Computational Mechanics Publications. WIT Press, Hagenberg, Austria, 23-25.
44. MARIN, M., IDA, T., AND SUZUKI, T. 2000. Cooperative constraint functional logic programming. In International Symposium on Principles of Software Evolution (IPSE'2000), T. Katayama, T. Tamai, and N. Yonezaki, Eds. IEEE, Kanazawa, Japan, 223-230.
45. MARRIOT, K. AND STUCKEY, P. J. 1998. Programming with constraints. The MIT Press, Cambridge, Massachusetts.
46. MIDDELDORP, A. AND OKUI, S. 1998. Deterministic lazy narrowing calculus. Journal of Symbolic Computation 25, 6, 733-757.
47. MIDDELDORP, A., SUZUKI, T., AND HAMADA, M. 2002. Complete selection functions for a lazy conditional narrowing calculus. Journal of Functional and Logic Programming 3.
48. PEYTON-JONES, S. 1987. The implementation of functional programming languages. Prentice Hall, Englewood Cliffs, N.J.
49. SHEARER, J. 1990. Some new optimum golomb rulers. IEEE Transactions on Information Theory 36, 183-184.
50. SICSTUS PROLOG. 2005. http://www.sics.se/isl/sicstus.
51. SWI-PROLOG. 2005. http://www.swi-prolog.org/.
52. TSANG, E. 1993. Foundations of constraint satisfaction. Academic Press, London and San Diego.
53. VAN HENTENRYCK, P. 1989. Constraint satisfaction in logic programming. The MIT Press, Cambridge, MA.
54. VAN HENTENRYCK, P. 1999. The OPL optimization programming language. The MIT Press, Cambridge, MA.
55. VAN ROY, P., BRAND, P., DUCHIER, D., HARIDI, S., HENZ, M., AND SCHULTE, C. 2003. Logic programming in the context of multiparadigm programming: the Oz experience. Theory and Practice of Logic Programming 3, 6 (November), 717-763.
56. VAN ROY, P. AND HARIDI, S. 2004. Concepts, techniques and models of computer programming. The MIT Press, Cambridge, MA.
57. WIELEMAKER, J. 2003. An overview of the SWI-Prolog programming environment. In Proceedings of the 13th International Workshop on Logic Programming Environments, F. Mesnard and A. Serebenik, Eds. Katholieke Universiteit Leuven, Heverlee, Belgium, 1-16. CW 371.