2011
DOI: 10.1007/s00607-011-0169-5
|View full text |Cite
|
Sign up to set email alerts
|

Solving set-valued constraint satisfaction problems

Abstract: Abstract. In this paper, we consider the resolution of constraint satisfaction problems in the case where the variables of the problem are subsets of R n . In order to use a constraint propagation approach, we introduce sets intervals, which are sets of subsets of R n with a lower bound and an upper bound with respect to the inclusion. Then, we propose an arithmetic for them. This makes possible to build projection operators that are then used by the propagation. In order to illustrate the principle and the ef… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2014
2014
2020
2020

Publication Types

Select...
6
1

Relationship

2
5

Authors

Journals

citations
Cited by 11 publications
(5 citation statements)
references
References 21 publications
0
5
0
Order By: Relevance
“…Granvilliers and Benhamou [19] proposed an algorithm that prunes boxes using both constraint propagation techniques and the interval Newton method. Recently, Domes and Neumaier [15] proposed a constraint propagation method for linear and quadratic constraints and Jaulin [27] studied set-valued CSPs.…”
Section: Review Of Constraint Propagation Methodsmentioning
confidence: 99%
“…Granvilliers and Benhamou [19] proposed an algorithm that prunes boxes using both constraint propagation techniques and the interval Newton method. Recently, Domes and Neumaier [15] proposed a constraint propagation method for linear and quadratic constraints and Jaulin [27] studied set-valued CSPs.…”
Section: Review Of Constraint Propagation Methodsmentioning
confidence: 99%
“…In this case, the location of the bifurcation points of the model in the bifurcation diagram must coincide with the location observed in the experimental dose response curves. To this aim we formulate next a constraint satisfaction problem [ 21 ] where a set of constraints impose the desired conditions on the decision variables.…”
Section: Resultsmentioning
confidence: 99%
“…This distinction is crucial for the proper handling of sets in computations. Thus a thick set, as a set of sets, is epistemic and represents an ill-known set, which is itself considered as ontic; for example, a physical area for which one wants to guarantee the coverage [14], for instance for making sure that a robot can pass in between two obstacles [15,16], is an ontic set.…”
Section: Epistemic Sets and Ontic Setsmentioning
confidence: 99%