Advertisement

Static and Dynamic Structural Symmetry Breaking

  • Pierre Flener
  • Justin Pearson
  • Meinolf Sellmann
  • Pascal Van Hentenryck
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4204)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Fahle, T., Schamberger, S., Sellmann, M.: Symmetry breaking. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, pp. 93–107. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  2. 2.
    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)CrossRefGoogle Scholar
  3. 3.
    Gent, I.P., Smith, B.M.: Symmetry breaking during search in constraint programming. In: Proceedings of ECAI 2000, pp. 599–603 (2000)Google Scholar
  4. 4.
    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)Google Scholar
  5. 5.
    Puget, J.-F.: An efficient way of breaking value symmetries. In: Proceedings of AAAI 2006. AAAI Press, Menlo Park (2006)Google Scholar
  6. 6.
    Régin, J.-C.: Generalized arc-consistency for global cardinality constraint. In: Proceedings of AAAI 1996, pp. 209–215. AAAI Press, Menlo Park (1996)Google Scholar
  7. 7.
    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)Google Scholar
  8. 8.
    Sellmann, M., Van Hentenryck, P.: Structural symmetry breaking. In: Proceedings of IJCAI 2005. Morgan Kaufmann, San Francisco (2005)Google Scholar
  9. 9.
    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)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Pierre Flener
    • 1
  • Justin Pearson
    • 1
  • Meinolf Sellmann
    • 2
  • Pascal Van Hentenryck
    • 2
  1. 1.Dept of Information TechnologyUppsala UniversityUppsalaSweden
  2. 2.Dept of Computer ScienceBrown UniversityProvidenceUSA

Personalised recommendations