Boi Faltings, Carlos Eisenberg
Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to detect unsolvability and is thus not suitable for highly constrained or overconstrained ...
Swiss Federal Institute of Technology (EPFL)2003