2000
DOI: 10.1007/3-540-44957-4_23
|View full text |Cite
|
Sign up to set email alerts
|

Better Communication for Tighter Cooperation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
9
0

Year Published

2003
2003
2009
2009

Publication Types

Select...
3
3
1

Relationship

1
6

Authors

Journals

citations
Cited by 8 publications
(9 citation statements)
references
References 2 publications
0
9
0
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%
“…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%
“…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%
“…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%
See 1 more Smart Citation