Solving Partially Symmetrical CSPs

Many CSPs contain a combination of symmetrical and asymmetrical constraints. We present a global approach that allows to apply any usual methods for breaking symmetries on the symmetrical part of a CSP and then to search for a global solution by integrating afterwards the asymmetrical constraints. Then, we focus on optimization problems where only the cost function is asymmetrical. We show experimentally that in this case we can speed up the search of some problems.