Abstract
We reconsider the idea of structural symmetry breaking (SSB) for constraint satisfaction problems (CSPs). We show that the dynamic dominance checks used in symmetry breaking by dominance-detection search for CSPs with piecewise variable and value symmetries have a static counterpart: there exists a set of constraints that can be posted at the root node and that breaks all these symmetries. The amount of these symmetry-breaking constraints is linear in the size of the problem, but they possibly remove a super-exponential number of symmetries on both values and variables. Moreover, static and dynamic structural symmetry breaking coincide for static variable and value orderings. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Flener, P., Pearson, J., Sellmann, M., & Van Hentenryck, P. (2006). Static and dynamic structural symmetry breaking. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4204 LNCS, pp. 695–699). Springer Verlag. https://doi.org/10.1007/11889205_53
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
