On the cooperation of the constraint domains ℋ, ℛ, and ℱ in CFLP

DOI10.1017/S1471068409003780zbMath1177.68040MaRDI QIDQ3183129

Teresa Hortalá-González, Rafael del Vado Vírseda, Mario Rodríguez Artalejo, Antonio J. Fernández, Fernando Sáenz-Pérez, Sonia Estévez-Martín

Publication date: 19 October 2009

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s1471068409003780

zbMATH Keywords

constrained lazy narrowing; constraint functional logic programming; constraint domains

Mathematics Subject Classification ID

68N18: Functional programming and lambda calculus

68N17: Logic programming

Related Items

Applying Constraint Logic Programming to SQL Semantic Analysis, Modular Constraint Solver Cooperation via Abstract Interpretation, A Theoretical Framework for the Higher-Order Cooperation of Numeric Constraint Domains, Cooperation of Algebraic Constraint Domains in Higher-Order Functional and Logic Programming

Cites Work

• Unnamed Item
• Interval propagation to reason about sets: Definition and implementation of a practical language
• A new generic scheme for functional logic programming with constraints
• Equational problems and disunification
• Combination of constraint solvers for free and quasi-free structures
• Narrowing based procedures for equational disunification
• A theory of type polymorphism in programming
• A new approach to integrating mixed integer programming and constraint logic programming
• Combining symbolic constraint solvers on algebraic domains
• Concurrent cooperating solvers over reals
• On the combination of interval constraint solvers
• Efficient interval linear equality solving in constraint logic programming
• Unification in the union of disjoint equational theories: Combining decision procedures
• Integration of declarative and constraint programming
• A needed narrowing strategy
• Simplification by Cooperating Decision Procedures
• The semantics of constraint logic programs1Note that reviewing of this paper was handled by the Editor-in-Chief.1
• Design, implementation, and evaluation of the constraint language cc(FD)
• On solving equations and disequations
• Applying interval arithmetic to real, integer, and boolean constraints
• Introduction to the constraint language NCL
• An approach to declarative programming based on a rewriting logic
• Term Rewriting and All That
• The Principal Type-Scheme of an Object in Combinatory Logic