A Fully Sound Goal Solving Calculus for the Cooperation of Solvers in the CFLP Scheme

Authors:
S. Estévez Martín;A. J. Fernández;M. T. Hortalá González;M. Rodríguez Artalejo;R. del Vado Vírseda
Affiliations:
Departamento de Sistemas Informáticos y Computación, Universidad Complutense de Madrid;Departamento de Lenguajes y Ciencias de la Computación, Universidad de Málaga;Departamento de Sistemas Informáticos y Computación, Universidad Complutense de Madrid;Departamento de Sistemas Informáticos y Computación, Universidad Complutense de Madrid;Departamento de Sistemas Informáticos y Computación, Universidad Complutense de Madrid
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2007

Citing 4
Cited 4

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
A new generic scheme for functional logic programming with constraints

Higher-Order and Symbolic Computation
Constraint functional logic programming over finite domains

Theory and Practice of Logic Programming
Declarative constraint programming with definitional trees

FroCoS'05 Proceedings of the 5th international conference on Frontiers of Combining Systems

Cooperation of constraint domains in the TOY system

Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
On the cooperation of the constraint domains ℋ, ℛ, and ℱ in cflp

Theory and Practice of Logic Programming
TOY: A System for Experimenting with Cooperation of Constraint Domains

Electronic Notes in Theoretical Computer Science (ENTCS)
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

The CFLP scheme for Constraint Functional Logic Programming has instances CFLP(D) corresponding to different constraint domains D. In this paper, we propose an amalgamated sum construction for building coordination domains C, suitable to represent the cooperation among several constraint domains D"1,...,D"n via a mediatorial domain M. Moreover, we present a cooperative goal solving calculus for CFLP(C), based on lazy narrowing, invocation of solvers for the different domains D"i involved in the coordination domain C, and projection operations for converting D"i constraints into D"j constraints with the aid of mediatorial constraints (so-called bridges) supplied by M. Under natural correctness assumptions for the projection operations, the cooperative goal solving calculus can be proved fully sound w.r.t. the declarative semantics of CFLP(C). As a relevant concrete instance of our proposal, we consider the cooperation between Herbrand, real arithmetic and finite domain constraints.