Abstract | ||
---|---|---|
We present a constraint functional logic programming ap- proach over flnite domain (CFLP(FD)) for integrating flnite domain constraints into the functional logic language TOY. CFLP(FD)programs consist of TOYrules with flnite domain constraints declared as functions. CFLP(FD) seamlessly combines the power of the constraint logic pro- gramming over flnite domains with the higher order characteristics of the functional logic programming paradigm. This paper describes a language for CFLP(FD), an implementation of our language for CFLP(FD)and programming examples that demonstrate the potential of the integra- tion. |
Year | Venue | Keywords |
---|---|---|
2002 | appia-gulp-prode | scheduling,finite domains.,constraint programming,functional logic pro- gramming |
Field | DocType | Citations |
Programming language,Computer science,Logic programming | Conference | 0 |
PageRank | References | Authors |
0.34 | 6 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Antonio J. Fernandez | 1 | 32 | 2.72 |
Maria Teresa Hortalá-González | 2 | 14 | 1.45 |
Fernando Sáenz-Pérez | 3 | 14 | 1.11 |