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

DOI10.1017/S1471068409003780zbMATH Open1177.68040OpenAlexW1974873965MaRDI QIDQ3183129FDOQ3183129

Authors: S. Estévez Martín, T. Hortalá-González, M. Rodríguez Artalejo, R. del Vado Vírseda, F. Sáenz-Pérez, A. J. Fernández 

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

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

zbMATH Keywords

constrained lazy narrowingconstraint functional logic programmingconstraint domains

Mathematics Subject Classification ID

Logic programming (68N17) Functional programming and lambda calculus (68N18)

Cites Work

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

Cited In (8)

• Modular Constraint Solver Cooperation via Abstract Interpretation
• Title not available (Why is that?)
• A new generic scheme for functional logic programming with constraints
• A Theoretical Framework for the Higher-Order Cooperation of Numeric Constraint Domains
• Applying Constraint Logic Programming to SQL Semantic Analysis
• 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

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)