Interval propagation methods implement local consistency techniques and have to be combined together with enumeration techniques to compute approximations of the solutions satisfying the initial constraint set. Unfortunately the number of enumeration steps may be important due to unappropriate expressions of the initial problem. We show how Groebner bases computations, used as a preprocessing step, may generate better expressions of the initial problem which can be solved faster using interval propagation methods. Furthermore, we provide a general semantics for combining these different methods.
In the talk we present some small examples to illustrate the method and we give experimental results.
