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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Fahle, T., Schamberger, S., Sellmann, M.: Symmetry breaking. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, pp. 93–107. Springer, Heidelberg (2001)
Focacci, F., Milano, M.: Global cut framework for removing symmetries. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, pp. 77–92. Springer, Heidelberg (2001)
Gent, I.P., Smith, B.M.: Symmetry breaking during search in constraint programming. In: Proceedings of ECAI 2000, pp. 599–603 (2000)
Puget, J.-F.: On the satisfiability of symmetrical constrained satisfaction problems. In: Komorowski, J., Raś, Z.W. (eds.) ISMIS 1993. LNCS, vol. 689, pp. 350–361. Springer, Heidelberg (1993)
Puget, J.-F.: An efficient way of breaking value symmetries. In: Proceedings of AAAI 2006. AAAI Press, Menlo Park (2006)
Régin, J.-C.: Generalized arc-consistency for global cardinality constraint. In: Proceedings of AAAI 1996, pp. 209–215. AAAI Press, Menlo Park (1996)
Roney-Dougal, C.M., Gent, I.P., Kelsey, T., Linton, S.: Tractable symmetry breaking using restricted search trees. In: Proceedings of ECAI 2004, pp. 211–215. IOS Press, Amsterdam (2004)
Sellmann, M., Van Hentenryck, P.: Structural symmetry breaking. In: Proceedings of IJCAI 2005. Morgan Kaufmann, San Francisco (2005)
Van Hentenryck, P., Flener, P., Pearson, J., Ågren, M.: Tractable symmetry breaking for CSPs with interchangeable values. In: Proceedings of IJCAI 2003. Morgan Kaufmann, San Francisco (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Flener, P., Pearson, J., Sellmann, M., Van Hentenryck, P. (2006). Static and Dynamic Structural Symmetry Breaking. In: Benhamou, F. (eds) Principles and Practice of Constraint Programming - CP 2006. CP 2006. Lecture Notes in Computer Science, vol 4204. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11889205_53
Download citation
DOI: https://doi.org/10.1007/11889205_53
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-46267-5
Online ISBN: 978-3-540-46268-2
eBook Packages: Computer ScienceComputer Science (R0)