Better Communication for Tighter Cooperation

Hofstedt, Petra

doi:10.1007/3-540-44957-4_23

Cited by 8 publications

(9 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In Section 6 we discussed several examples of how DICE can be used as a platform for solver cooperation, but compared to a solver cooperation language such as BALI (see for example [13]), and the system described in [10] the possibilities are limited: the cooperation scheme is always the distributed fixpoint computation, and the model of constraint solving is fixed to branch-and-prune search. However, in [11] it is explained how the distributed propagation algorithm can be forced to apply DRF's in a specific sequence.…”

Section: Resultsmentioning

confidence: 99%

A Coordination-Based Framework for Distributed Constraint Solving

Zoeteweij

2003

Lecture Notes in Computer Science

View full text Add to dashboard Cite

C e n t r u m v o o r W i s k u n d e e n I n f o r m a t i c a ) is a framework for the construction of distributed constraint solvers from software components in a number of predefined categories. The framework is implemented using the Manifold coordination language, and coordinates the components of a distributed solver by means of coordination protocols that implement a distributed constraint propagation algorithm, a distributed termination detection algorithm, and facilities for the distributed splitting of a constraint satisfaction problem. The aim of this report is to give an overview of DICE. In addition to the coordination protocols, the report describes the framework architecture and solver configuration language, and discusses our plans for further development.

show abstract

Section: Resultsmentioning

confidence: 99%

A Coordination-Based Framework for Distributed Constraint Solving

Zoeteweij

2003

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…Therefore we focus on the second approach, which is more flexible and more economic. In (Hofstedt 2000a) a framework for cooperating constraint solvers has been introduced and formally described, including cooperation strategies for the solvers. In (Hofstedt 2001) termination and confluence, as well as soundness and completeness restrictions are examined.…”

Section: Cooperating Constraint Solversmentioning

confidence: 99%

Integration of declarative and constraint programming

Hofstedt¹,

Pepper²

2007

Theory and Practice of Logic Programming

Self Cite

View full text Add to dashboard Cite

Combining a set of existing constraint solvers into an integrated system of cooperating solvers is a useful and economic principle to solve hybrid constraint problems. In this paper we show that this approach can also be used to integrate different language paradigms into a unified framework. Furthermore, we study the syntactic, semantic and operational impacts of this idea for the amalgamation of declarative and constraint programming.

show abstract

“…A general scheme for solver cooperation was proposed by Hofstedt [2000]. In this paper, domains were defined by using " -Structures" in a sorted language and a constraint was a relation over an n-ary Cartesian product of the domains.…”

Section: Related Workmentioning

confidence: 99%

“…As for our framework, solvers are combined by means of the Cartesian product of the domains. However, Hofstedt [2000] assumed that each component domain has its own associated solver built into the system and therefore focused on the interface between the component solvers; the complete system consisted of the interface plus a set of built-in constraint systems. In contrast, in our proposal the high-level constraints determine the possible cooperation that can occur between the domains and their solvers and these constraints may be defined by the user or system.…”

Section: Related Workmentioning

confidence: 99%

“…In contrast, in our proposal the high-level constraints determine the possible cooperation that can occur between the domains and their solvers and these constraints may be defined by the user or system. Note that the flexibility of these high-level constraints implies that the solver interface defined by Hofstedt [2000] could be implemented in our system. Constraint systems such as CLP(BNR) [Benhamou and Older 1997] and Prolog IV [N'Dong 1997] provide some support for cooperation between solvers.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

An interval constraint system for lattice domains

Fernández

Hill

2004

ACM Trans. Program. Lang. Syst.

View full text Add to dashboard Cite

We present a generic framework for defining and solving interval constraints on any set of domains (finite or infinite) that are lattices. The approach is based on the use of a single form of constraint similar to that of an indexical used by CLP for finite domains and on a particular generic definition of an interval domain built from an arbitrary lattice. We provide the theoretical foundations for this framework and a schematic procedure for the operational semantics. Examples are provided that illustrate how new (compound) constraint solvers can be constructed from existing solvers using lattice combinators and how different solvers (possibly on distinct domains) can communicate and hence, cooperate in solving a problem. We describe the language clp(L), which is a prototype implementation of this framework and discuss ways in which this implementation may be improved.

show abstract

Better Communication for Tighter Cooperation

Cited by 8 publications

References 2 publications

A Coordination-Based Framework for Distributed Constraint Solving

A Coordination-Based Framework for Distributed Constraint Solving

Integration of declarative and constraint programming

An interval constraint system for lattice domains

Contact Info

Product

Resources

About