Advertisement
Published in:
2012 | OriginalPaper | Chapter
Extending the System with the ECL i PS e Solver over Sets of Integers
Authors : Sonia Estévez-Martín, Jesús Correas Fernández, Fernando Sáenz-Pérez
Published in: Functional and Logic Programming
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Starting from a computational model for the cooperation of constraint domains in the CFLP context (with lazy evaluation and higher-order functions), we present the theoretical basis for the coordination domain
$\mathcal{C}$
tailored to the cooperation of three pure domains: the domain of finite sets of integers (
$\mathcal{FS}$
), the finite domain of integers (
$\mathcal{FD}$
) and the Herbrand domain (
$\mathcal{H}$
). We also present the adaptation of the goal-solving calculus
$CCLNC{\mathcal C}$
(Cooperative Constraint Lazy Narrowing Calculus over
$\mathcal{C}$
) to this particular case, as well as soundness and limited completeness results. An implementation of this cooperation in the CFLP system
${\mathcal TOY}$
is presented. Our implementation is based on inter-process communication between
${\mathcal TOY}$
and the external solvers for sets of integers and finite domain of ECL
i
PS
e
.