Solving set-valued constraint satisfaction problems (Q411438)

This paper wants to solve the satisfaction problem for subsets of \(\mathbb R^n\), i.e., it wants to find i-sets that form lower and upper containment bounds for a given n-dimensional set of data points. First set intervals, called i-sets in \(\mathbb R^n\) are defined and their basic properties and operations are established. Then basic contractors are used for the problem. A test in \(\mathbb R^2\) of the resulting constraint propagation method for non-convex data sets is described at the end.