Name
Abstract | ||
|---|---|---|
This paper presents a computational model for the cooperation of constraint domains, based on a generic Constraint Functional Logic Programming (CFLP) Scheme and designed to support declarative programming with functions, predicates and the cooperation of different constraint domains equipped with their respective solvers. We have developed an implementation in the CFLP system TOY, supporting an instance of the scheme which enables the cooperation of symbolic Herbrand constraints, finite domain integer constraints, and real arithmetic constraints. We provide a theoretical result and an analysis of benchmarks showing a good performance with respect to the closest related approach we are aware of |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1145/1389449.1389481 | PPDP |
Keywords | Field | DocType |
toy system,closest related approach,finite domain integer constraint,symbolic herbrand constraint,constraint domain,cflp system,real arithmetic constraint,generic constraint functional logic,computational model,different constraint,declarative programming,computer model,functional logic programming | Functional logic programming,Constraint satisfaction,Mathematical optimization,Programming language,Computer science,Inductive programming,Constraint programming,Theoretical computer science,Concurrent constraint logic programming,Logic programming,Constraint logic programming,Satisfiability modulo theories | Conference |
Citations | PageRank | References |
0 | 0.34 | 13 |
Authors | ||
6 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sonia Estévez-Martín | 1 | 0 | 1.01 |
| Antonio J. Fernández | 2 | 0 | 0.34 |
| Maria Teresa Hortalá-González | 3 | 14 | 1.45 |
| Mario Rodríguez-Artalejo | 4 | 716 | 59.70 |
| Fernando Sáenz-Pérez | 5 | 69 | 15.50 |
| Rafael del Vado V́ırseda | 6 | 97 | 13.26 |