Symbolic-interval cooperation in constraint programming
Laurent Granvilliers, Éric Monfroy, Frédéric Benhamou · 2001
This paper surveys the field of cooperative constraint solving for a constraint programming perspective with an emphasis on combinations of symbolic and interval methods. On the one hand, symbolic methods provide adapted representations of the constraint expressions. On the other hand, interval methods compute verified enclosures of solution sets. Using cooperation of solvers, one can take advantage of both techniques in a unified framework: symbolic algorithms generally need to be combined with root extraction methods, and the efficiency of interval algorithms strongly depends on constraint expressions.