Journal
COMPUTING
Volume 94, Issue 2-4, Pages 297-311Publisher
SPRINGER WIEN
DOI: 10.1007/s00607-011-0169-5
Keywords
Constraint propagation; Constraint satisfaction; Contractors; Interval analysis; Set intervals
Categories
Ask authors/readers for more resources
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 set intervals (named i-sets), which are sets of subsets of R-n with a lower bound and an upper bound with respect to the inclusion. Then, we propose basic operations for i-sets. This makes possible to build contractors that are then used by the propagation to solve problem involving sets as unknown variables. In order to illustrate the principle and the efficiency of the approach, a testcase is provided.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available