POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Lecture notes in computer science on Foundations of logic and functional programming
Equational problems anddisunification
Journal of Symbolic Computation
Communications of the ACM
The CLP( R ) language and system
ACM Transactions on Programming Languages and Systems (TOPLAS)
Constraint satisfaction using constraint logic programming
Artificial Intelligence - Special volume on constraint-based reasoning
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On solving equations and disequations
Journal of the ACM (JACM)
Combining symbolic constraint solvers on algebraic domains
Journal of Symbolic Computation
Unification in the union of disjoint equational theories: combining decision procedures
Journal of Symbolic Computation
Combination of constraint solvers for free and quasi-free structures
Theoretical Computer Science - Special issue: rewriting systems and applications
Term rewriting and all that
A solver collaboration in BALI
JICSLP'98 Proceedings of the 1998 joint international conference and symposium on Logic programming
An open automated framework for constraint solver extension: the SoleX approach
Fundamenta Informaticae - Special issue on symbolic computation and artificial intelligence
Using coordination for cooperative constraint solving
SAC '98 Proceedings of the 1998 ACM symposium on Applied Computing
Revising hull and box consistency
Proceedings of the 1999 international conference on Logic programming
Journal of the ACM (JACM)
Simplification by Cooperating Decision Procedures
ACM Transactions on Programming Languages and Systems (TOPLAS)
Functional and constraint logic programming
Constraints in computational logics
Principal type-schemes for functional programs
POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A Rewriting Logic for Declarative Programming
ESOP '96 Proceedings of the 6th European Symposium on Programming Languages and Systems
Building Constraint Solvers with HAL
Proceedings of the 17th International Conference on Logic Programming
A Demand Driven Computation Strategy for Lazy Narrowing
PLILP '93 Proceedings of the 5th International Symposium on Programming Language Implementation and Logic Programming
Combining Layz Narrowing with Disequality Constraints
PLILP '94 Proceedings of the 6th International Symposium on Programming Language Implementation and Logic Programming
Compiling Multi-Paradigm Declarative Programs into Prolog
FroCoS '00 Proceedings of the Third International Workshop on Frontiers of Combining Systems
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
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Heterogeneous Constraint Solving
ALP '96 Proceedings of the 5th International Conference on Algebraic and Logic Programming
Branch and Infer: a Unifying Framework for Integer and Finite Domain Constraint Programming
INFORMS Journal on Computing
A demand-driven narrowing calculus with overlapping definitional trees
Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
Coordination-based distributed constraint solving in DICE
Proceedings of the 2003 ACM symposium on Applied computing
An interval constraint system for lattice domains
ACM Transactions on Programming Languages and Systems (TOPLAS)
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)
Cooperation of constraint domains in the TOY system
Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
Solution strategies for multi-domain constraint logic programs
PSI'06 Proceedings of the 6th international Andrei Ershov memorial conference on Perspectives of systems informatics
A higher-order demand-driven narrowing calculus with definitional trees
ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
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
A component language for hybrid solver cooperations
ADVIS'04 Proceedings of the Third international conference on Advances in Information Systems
Declarative constraint programming with definitional trees
FroCoS'05 Proceedings of the 5th international conference on Frontiers of Combining Systems
TOY: A System for Experimenting with Cooperation of Constraint Domains
Electronic Notes in Theoretical Computer Science (ENTCS)
Cooperation of algebraic constraint domains in higher-order functional and logic programming
AMAST'10 Proceedings of the 13th international conference on Algebraic methodology and software technology
A Theoretical Framework for the Higher-Order Cooperation of Numeric Constraint Domains
Electronic Notes in Theoretical Computer Science (ENTCS)
A modular semantics for higher-order declarative programming with constraints
Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming
Integrating ILOG CP technology into TOY
WFLP'09 Proceedings of the 18th international conference on Functional and Constraint Logic Programming
Extending the TOY system with the ECLiPSe solver over sets of integers
FLOPS'12 Proceedings of the 11th international conference on Functional and Logic Programming
| Hi-index | 0.00 |
This paper presents a computational model for the cooperation of constraint domains and an implementation for a particular case of practical importance. The computational model supports declarative programming with lazy and possibly higher-order functions, predicates, and the cooperation of different constraint domains equipped with their respective solvers, relying on a so-called constraint functional logic programming (CFLP) scheme. The implementation has been developed on top of the CFLP system , supporting the cooperation of the three domains ℋ, ℛ, and ℱ , which supply equality and disequality constraints over symbolic terms, arithmetic constraints over the real numbers, and finite domain constraints over the integers, respectively. The computational model has been proved sound and complete w.r.t. the declarative semantics provided by the CFLP scheme, while the implemented system has been tested with a set of benchmarks and shown to behave quite efficiently in comparison to the closest related approach we are aware of.