Concurrent Cooperating Solvers over Reals


Abstract

Systems combining an interval narrowing solver and a linear programming solver can tackle constraints over the reals that none of these solvers can handle on their own. In this paper we introduce a cooperating scheme where an interval narrowing solver and a linear programming solver work concurrently. Information exchanged by the solvers is therefore handled as soon as it becomes available. Moreover, to improve the pruning, the linear programming solver computes the actual range of values of each variable with respect to the subset of linear constraints. To validate the proposed architecture a prototype system --named CCC-- has been developed. Several examples are given to illustrate the gain in speed and precision we can expect with CCC.
Full paper (postscript)