|Title||Cooperative solvers in constraint programming: A short introduction|
|Author(s)|| Frederic Benhamou, Laurent Granvilliers, Eric Monfroy|
|Text||L. Granvilliers, E. Monfroy, and F. Benhamou. Cooperative solvers in constraint
programming: A short introduction. In Workshop on Cooperative Solvers in Constraint Programming (CoSolv) at CP 2001, 2001.|
|Type||Technical Report, Misc|
|Abstract||In the constraint programming community, solver cooperation is now wellknown as a concept for improving efficiency and performance of constraint solvers. Generic solvers are generally far too inefficient for solving numerous real-life problems. However, a large part of these problems can often be handled by specific and efficient solvers (but possibly not complete, i.e., that cannot|
prove inconsistency). For instance, an efficient algorithm such as the Simplex can process a linear sub-problem extracted from a nonlinear constraint system. In this case, cooperation consists in using the result of Simplex within a nonlinear solver.
The goal of cooperation is to share and exchange data between solvers in order to tackle new types of problems (for which there is no solver), to improve the representation of solutions, and/or to speed-up computation. However, three major problems arise when dealing with cooperation of solvers: theoretical issues, communication, and strategies of cooperation.