On the cooperation of the constraint domains ℋ, ℛ, and ℱ in CFLP
From MaRDI portal
Publication:3183129
Recommendations
- scientific article; zbMATH DE number 1822298
- A Theoretical Framework for the Higher-Order Cooperation of Numeric Constraint Domains
- A fully sound goal solving calculus for the cooperation of solvers in the CFLP scheme
- Cooperation of algebraic constraint domains in higher-order functional and logic programming
- A proposal for the cooperation of solvers in constraint functional logic programming
- scientific article; zbMATH DE number 1406243
- Exploiting semidefinite relaxations in constraint programming
- Constraint retraction in CLP(FD): Formal framework and performance results
Cites work
- scientific article; zbMATH DE number 1550909 (Why is no real title available?)
- A needed narrowing strategy
- A new approach to integrating mixed integer programming and constraint logic programming
- A new generic scheme for functional logic programming with constraints
- A theory of type polymorphism in programming
- An approach to declarative programming based on a rewriting logic
- Applying interval arithmetic to real, integer, and boolean constraints
- Combination of constraint solvers for free and quasi-free structures
- Combining symbolic constraint solvers on algebraic domains
- Concurrent cooperating solvers over reals
- Design, implementation, and evaluation of the constraint language cc(FD)
- Efficient interval linear equality solving in constraint logic programming
- Equational problems and disunification
- Integration of declarative and constraint programming
- Interval propagation to reason about sets: Definition and implementation of a practical language
- Introduction to the constraint language NCL
- Narrowing based procedures for equational disunification
- On solving equations and disequations
- On the combination of interval constraint solvers
- Simplification by Cooperating Decision Procedures
- Term Rewriting and All That
- The Principal Type-Scheme of an Object in Combinatory Logic
- The semantics of constraint logic programs1Note that reviewing of this paper was handled by the Editor-in-Chief.1
- Unification in the union of disjoint equational theories: Combining decision procedures
Cited in
(10)- A new generic scheme for functional logic programming with constraints
- scientific article; zbMATH DE number 2096830 (Why is no real title available?)
- A Theoretical Framework for the Higher-Order Cooperation of Numeric Constraint Domains
- Modular constraint solver cooperation via abstract interpretation
- Constraint functional logic programming over finite domains
- Cooperation of algebraic constraint domains in higher-order functional and logic programming
- Extending the \(\mathcal{TOY}\) system with the \(\mathrm{ECL}^i\mathrm{PS}^e\) solver over sets of integers
- Constraint functional logic programming revisited
- A proposal for the cooperation of solvers in constraint functional logic programming
- Applying constraint logic programming to SQL semantic analysis
This page was built for publication: On the cooperation of the constraint domains ℋ, ℛ, and ℱ in CFLP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3183129)
