Using Local Search for guiding enumeration in constraint solving

Abstract

In Constraint Programming, enumeration strategies (selection of a variable and a value of its domain) are crucial for resolution performances. We propose to use Local Search for guiding enumeration: we extend the common variable selection strategies of constraint programming and we achieve the value selection based on a Local Search. The experimental results are rather promising. © Springer-Verlag Berlin Heidelberg 2006.