Skip to main content

Automatic Detection of Variable and Value Symmetries

  • Conference paper

Part of the Lecture Notes in Computer Science book series (LNPSE,volume 3709)

Abstract

Many symmetry breaking techniques assume that the symmetries of a CSP are given as input in addition to the CSP itself. We present a method that can be used to detect all the symmetries of a CSP. This method constructs a graph that has the same symmetries as the CSP. Then, generators for the symmetry group are computed using a graph automorphism algorithm. This method improves and extends previous work in order to cover global constraints, arithmetic expressions and value symmetries. We show that this method is able to find symmetries for examples that were thought to be too convoluted for automated detection. We also show that the overhead of symmetry detection is quite negligible, even on very large instances. We present a comprehensive set of examples where automated symmetry detection is coupled with symmetry breaking techniques.

Keywords

  • Simple Graph
  • Global Constraint
  • Variable Symmetry
  • Graph Automorphism
  • Symmetry Detection

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/11564751_36
  • Chapter length: 15 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
eBook
USD   149.00
Price excludes VAT (USA)
  • ISBN: 978-3-540-32050-0
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   189.00
Price excludes VAT (USA)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Crawford, J., Ginsberg, M., Luks, E.M., Roy, A.: Symmetry Breaking Predicates for Search Problems. In: Proceedings of KR 1996, pp. 148–159 (1996)

    Google Scholar 

  2. Darga, P.T., Liffiton, M.H., Sakallah, K.A., Markov, I.L.: Exploiting structure in symmetry detection for CNF. In: DAC 2004, pp. 530–534 (2004)

    Google Scholar 

  3. Flener, P., Frisch, A.M., Hnich, B., Kiziltan, Z., Miguel, I., Pearson, J., Walsh, T.: Breaking Row and Column Symmetries in Matrix Models. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 462–476. Springer, Heidelberg (2002)

    CrossRef  Google Scholar 

  4. Frisch, A.M., Miguel, I., Walsh, T.: CGRASS: A System for Transforming Constraint Satisfaction Problems. In: ERCIM/Colognet Workshop on Constraint Solving and Constraint Logic Programming, pp. 15–30 (2002)

    Google Scholar 

  5. Gent, I.P., Harvey, W., Kelsey, T.: Groups and Constraints: Symmetry Breaking During Search. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 415–430. Springer, Heidelberg (2002)

    CrossRef  Google Scholar 

  6. Gent, I.P., Harvey, W., Kelsey, T., Linton, S.: Generic SBDD Using Computational Group Theory. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 333–347. Springer, Heidelberg (2003)

    CrossRef  Google Scholar 

  7. Harvey, W., Kelsey, T., Petrie, K.: Symmetry Group generation for CSPs. In: Proceedings of SymCon 2003 (2003)

    Google Scholar 

  8. ILOG: ILOG Solver 6.0. User Manual. ILOG, S.A., Gentilly, France (September 2003)

    Google Scholar 

  9. Kelsey, T., Linton, S.A., Roney-Dougal, C.M.: New Developments in Symmetry Breaking in Search Using Computational Group Theory. In: Buchberger, B., Campbell, J. (eds.) AISC 2004. LNCS (LNAI), vol. 3249, pp. 199–210. Springer, Heidelberg (2004)

    CrossRef  Google Scholar 

  10. Kobler, J., Schoning, U., Toran, J.: The Graph Isomorphism Problem: Its Structural Complexity. Birkhäuser, Basel (1993)

    Google Scholar 

  11. McDonald, I.: NuSBDS: Symmetry Breaking made easy. In: Proceedings of SymCon 2003 (2003)

    Google Scholar 

  12. Mc Kay, B.: Practical Graph Isomorphism. Congr. Numer. 30, 45–87 (1981)

    MathSciNet  Google Scholar 

  13. Margot, F.: Exploiting Orbits in Symmetric ILP. Mathematical Programming Ser. B 98, 3–21 (2003)

    CrossRef  MathSciNet  MATH  Google Scholar 

  14. Puget, J.-F.: Symmetry Breaking Using Stabilizers. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 585–599. Springer, Heidelberg (2003)

    CrossRef  Google Scholar 

  15. Puget, J.-F.: Breaking symmetries in all different problems. To appear in Proceedings of IJCAI 2005 (2005)

    Google Scholar 

  16. Puget, J.-F.: Breaking All Value Symmetries in Surjection Problems. To appear in proceedings of CP 2005, Sitges (2005)

    Google Scholar 

  17. Ramani, A., Markov, I.: Automatically Exploiting Symmetries in Constraint Programming. In: Proceedings of SymCon 2004 (2004)

    Google Scholar 

  18. Regin, J.-C.: Generalized Arc Consistency for Global Cardinality Constraint. In: AAAI 1996, Portland, OR, USA, pp. 209–215 (1996)

    Google Scholar 

  19. Regin, J.-C.: Constraint Programming and Sports Scheduling Problems. Informs, Cincinnati (May 1999)

    Google Scholar 

  20. Roney-Dougal, C.M., Gent, I.P., Kelsey, T., Linton, S.: Tractable symmetry breaking using restricted search trees. In: Proceedings of ECAI 2004 (2004)

    Google Scholar 

  21. Sellmann, M., Van Hentenryck, P.: Structural Symmetry Breaking. To appear in proceedings of IJCAI 2005 (2005)

    Google Scholar 

  22. Smith, B., Sturdy, P.: Value Ordering for Finding All Solutions. To appear in proceedings of IJCAI 2005 (2005)

    Google Scholar 

  23. Ven Hentenryck, P., Flener, P., Pearsons, J., Agren, M.: Compositional derivation of symmetries for constraint satisfaction. In: Zucker, J.-D., Saitta, L. (eds.) SARA 2005. LNCS (LNAI), vol. 3607, pp. 234–247. Springer, Heidelberg (2005)

    CrossRef  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Puget, JF. (2005). Automatic Detection of Variable and Value Symmetries. In: van Beek, P. (eds) Principles and Practice of Constraint Programming - CP 2005. CP 2005. Lecture Notes in Computer Science, vol 3709. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11564751_36

Download citation

  • DOI: https://doi.org/10.1007/11564751_36

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29238-8

  • Online ISBN: 978-3-540-32050-0

  • eBook Packages: Computer ScienceComputer Science (R0)