“…Later, CSPs were extended to continuous domains (subsets of lR or intervals) (Cleary, 1987;Davis, 1987;Hyvonen, 1992;Lhomme, 1993;Benhamou et al, 1994;Haroud et al, 1995;Sam-Haroud, 1995;Sam-Haroud and Faltings, 1996;Deville et al, 1997;van Hentenryck et al, 1998;Lottaz et al, 1998). Most of the algorithms presented in these papers use consistency techniques such as those described below to find an outer approximation of the set § of all solutions of H. The main advantage of these techniques is that they yield a guaranteed enclosure of § with a complexity that can be kept polynomial in time and space.…”