Term rewriting and all that
Simplification by Cooperating Decision Procedures
ACM Transactions on Programming Languages and Systems (TOPLAS)
On the Combination of Symbolic Constraints, Solution Domains, and Constraint Solvers
CP '95 Proceedings of the First International Conference on Principles and Practice of Constraint Programming
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
A Fully Sound Goal Solving Calculus for the Cooperation of Solvers in the CFLP Scheme
Electronic Notes in Theoretical Computer Science (ENTCS)
A Proposal for the Cooperation of Solvers in Constraint Functional Logic Programming
Electronic Notes in Theoretical Computer Science (ENTCS)
A component language for hybrid solver cooperations
ADVIS'04 Proceedings of the Third international conference on Advances in Information Systems
On the cooperation of the constraint domains ℋ, ℛ, and ℱ in cflp
Theory and Practice of Logic Programming
| Hi-index | 0.00 |
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