Intermediate (learned) consistencies

Abstract

What makes a good consistency? Depending on the constraint, it may be a good pruning power or a low computational cost. By using machine learning techniques (search in an hypothesis space and clustering), we propose to define new automatically generated solvers which form a sequence of consistencies intermediate between bound- and arc-consistency. © Springer-Verlag 2003.