Learn More
HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L'archive ouverte pluridisciplinaire HAL, est destinée au dépôt età la diffusion(More)
We prove that hull consistency for a system of equations or inequalities can be achieved in polynomial time providing that the underlying functions are monotone with respect to each variable. This result holds including when variables have multiple occurrences in the expressions of the functions, which is usually a pitfall for interval-based contractors.(More)
Combining efficiency with reliability within CP systems is one of the main concerns of CP developers. This paper presents a simple and efficient way to connect Choco and Ibex, two CP solvers respectively spe-cialised on finite and continuous domains. This enables to take advantage of the most recent advances of the continuous community within Choco while(More)
This paper describes a solver programming method, called contractor programming, that copes with two issues related to constraint processing over the reals. First, continuous constraints involve an inevitable step of solver design. Existing softwares provide an insufficient answer by restricting users to choose among a list of fixed strategies. Our first(More)
This paper presents two new filtering operators for numerical CSPs (systems with constraints over the reals) based on constructive dis-junction, as well as a new splitting heuristic. The fist operator (CID) is a generic algorithm enforcing constructive disjunction with intervals. The second one (3BCID) is a hybrid algorithm mixing constructive disjunc-tion(More)
Researchers from interval analysis and constraint (logic) programming communities have studied intervals for their ability to manage infinite solution sets of numerical constraint systems. In particular, inner regions represent subsets of the search space in which all points are solutions. Our main contribution is the use of recent and new inner region(More)
This paper is a theoretical and experimental study of how interval arithmetic and analysis methods can be used to achieve (1) numerical certification of the kinematic calibration of parallel robots, and (2) a possible validation of the kine-matic model used in calibration. First, a detailed description is given of our experimental device and vision-based(More)
When considering systems of equations, it often happens that parameters are known with some uncertainties. This leads to continua of solutions that are usually approximated using the interval theory. A wider set of useful situations can be modeled if one allows furthermore different quantifications of the parameters in their domains. In particular,(More)
As opposed to finite domain CSPs, arc consistency cannot be enforced, in general, on CSPs over the reals, including very simple instances. In contrast, a stronger property, the so-called <i>box-set consistency</i>, that requires a no-split condition in addition to arc consistency, can be obtained on a much larger number of problems.To obtain this property,(More)
The geost constraint has been proposed to model and solve discrete placement problems involving multi-dimensional boxes (packing in space and time). The filtering technique is based on a sweeping algorithm that requires the ability for each constraint to compute a forbidden box around a given fixed point and within a surrounding area. Several cases have(More)