A Proposal for the Cooperation of Solvers in Constraint Functional Logic Programming

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

doi:10.1016/j.entcs.2007.05.037

Cited by 5 publications

(7 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…When solving this system the two available bridges can be used to project the R constraints RY >= d-0.5, RY-RX <= 0.5, RY+RX <= n+0.5 into the FD constraints Y #>= d, Y#-X #<= 0, Y#+X #<= n. Since n = 2*d, the only possible solution is X = Y = d. Therefore, the FD solver drastically prunes the domains of X and Y to the singleton set {d}, and solving the labeling constraint leads to the unique solution with no effort. For a big value of n = 2*d, the use of projections greatly enhances the performance of the computation, as shown by the experimental results given in [4] and Section 4 below.…”

Section: Introductionmentioning

confidence: 94%

“…A C-program allowing to solve goals related to the constraint system E discussed in Section 1 can be found in [4]. The set of variables obviously demanded by a goal G is defined as the least subset odvar(G) ⊆ var(G) including all the variables obviously demanded by the stores in G and all the variables X in some production (X a k → t) ∈ P such that either t is not a variable or else k > 0 and t ∈ odvar(G).…”

Section: Programs and Goalsmentioning

confidence: 99%

“…Natural and constructive definitions for the bridges and projections operations can be found in [4,5]. These operations can be proved safe in the sense that they do not miss any solution.…”

Section: Rules For Domain Cooperation and Constraint Solvingmentioning

confidence: 99%

“…We rely on the CF LP scheme [15] and the goal solving calculus [14], enriched with cooperation mechanisms inspired in our previous papers [4,5], where so-called bridges were introduced as a key tool for communicating constraints between different domains. Bridges are constraints of the form X #== d i ,d j Y which relate the values of two variables X :: di, Y :: dj of different base types, requiring them to be equivalent.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Cooperation of constraint domains in the TOY system

Martín

Fernández

Hortalá-González

et al. 2008

Proceedings of the 10th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming

View full text Add to dashboard Cite

This paper presents a computational model for the cooperation of constraint domains, based on a generic Constraint Functional Logic Programming (CF LP ) 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 CF LP system T OY, 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.

show abstract

Section: Introductionmentioning

confidence: 94%

Section: Programs and Goalsmentioning

confidence: 99%

“…Natural and constructive definitions for the bridges and projections operations can be found in [4,5]. These operations can be proved safe in the sense that they do not miss any solution.…”

Section: Rules For Domain Cooperation and Constraint Solvingmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Cooperation of constraint domains in the TOY system

Martín

Fernández

Hortalá-González

et al. 2008

Proceedings of the 10th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming

View full text Add to dashboard Cite

show abstract

“…Our computational model is based on the CFLP scheme and goal-solving calculus recently proposed in López-Fraguas et al (2004, which will be enriched with new mechanisms for modeling the intended cooperation. Moreover, we rely on the domain cooperation techniques proposed in our previous papers (Estévez-Martín et al 2007a, 2007b, 2008a, where we have introduced so-called bridges as a key tool for communicating constraints between different domains.…”

Section: Aims Of This Papermentioning

confidence: 99%

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

Martín

Hortalá-González

Rodríguez-Artalejo

et al. 2009

Theory and Practice of Logic Programming

Self Cite

View full text Add to dashboard Cite

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 theCFLPsystem, 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 theCFLPscheme, 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.

show abstract