A solver collaboration in BALI
JICSLP'98 Proceedings of the 1998 joint international conference and symposium on Logic programming
Basic components for constraint solver cooperations
Proceedings of the 2003 ACM symposium on Applied computing
A lazy narrowing calculus for declarative constraint programming
PPDP '04 Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming
Integration of declarative and constraint programming
Theory and Practice of Logic Programming
A new generic scheme for functional logic programming with constraints
Higher-Order and Symbolic Computation
Constraint functional logic programming over finite domains
Theory and Practice of Logic Programming
Declarative constraint programming with definitional trees
FroCoS'05 Proceedings of the 5th international conference on Frontiers of Combining Systems
Cooperation of constraint domains in the TOY system
Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
On the cooperation of the constraint domains ℋ, ℛ, and ℱ in cflp
Theory and Practice of Logic Programming
TOY: A System for Experimenting with Cooperation of Constraint Domains
Electronic Notes in Theoretical Computer Science (ENTCS)
Playing with TOY: constraints and domain cooperation
ESOP'08/ETAPS'08 Proceedings of the Theory and practice of software, 17th European conference on Programming languages and systems
| Hi-index | 0.00 |
This paper presents a proposal for the cooperation of solvers in constraint functional logic programming, a quite expressive programming paradigm which combines functional, logic and constraint programming using constraint lazy narrowing as goal solving mechanism. Cooperation of solvers for different constraint domains can improve the efficiency of implementations since solvers can take advantage of other solvers' deductions. We restrict our attention to the cooperation of three solvers, dealing with syntactic equality and disequality constraints, real arithmetic constraints, and finite domain (FD) constraints, respectively. As cooperation mechanism, we consider to propagate to the real solver the constraints which have been submitted to the FD solver (and viceversa), imposing special communication constraints to ensure that both solvers will allow the same integer values for all the variables involved in the cooperation.