Skip to main content

Breaking All Value Symmetries in Surjection Problems

  • Conference paper

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

Abstract

We propose a surprisingly simple new way of breaking all value symmetries with constraints. Our method requires the addition of one variable per value of the problem plus a linear number of binary constraints. The set of constraints is automatically computed from the symmetries of the problem using computational group theory. Our method applies to problems where every value is taken by at least one variable. Such problems occur frequently in practice. Various experiments show that our method is extremely effective when compared to previously published methods.

Keywords

  • Symmetry Breaking
  • Symmetry Group
  • Matrix Model
  • Binary Constraint
  • Solution Orbit

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_37
  • 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. Aloul, F., Markov, I., Sakallah, K.: Efficient Symmetry-Breaking for Boolean Satisfiability. In: Proceedings of IJCAI 2003, Acapulco, Mexico, pp. 271–282 (2003)

    Google Scholar 

  2. Benhamou, B.: Symmetry in Not-equals Binary Constraint Networks. In: Proceedings of SymCon 2004, Toronto, September 2004, pp. 2–8 (2004)

    Google Scholar 

  3. 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 

  4. 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 

  5. Gent, I.P.: A Symmetry Breaking Constraint for Indistinguishable Values. In: Proceedings of SymCon 2001. A CP 2001 workshop (2001)

    Google Scholar 

  6. Gent, I., Walsh, T., Selman, B.: CSPLIB, A problem library for constraints, http://www.csplib.org

  7. 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 

  8. 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 

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

    Google Scholar 

  10. 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 

  11. Law, Y.C., Lee, J.H.M.: Expressing Symmetry Breaking Constraints Using Multiple Viewpoints and Channeling Constraints. In: Proceedings of SymCon 2003 (held in conjunction with CP 2003), pp. 127–141 (2003)

    Google Scholar 

  12. Law, Y.C., Lee, J.H.M.: Breaking Value Symmetries in Matrix Models using Channeling Constraints. In: Proceedings of the 20th Annual ACM Symposium on Applied Computing (SAC 2005), pp. 375–380 (2005)

    Google Scholar 

  13. Dame Ollerenshaw, K.: On most perfect or complete 8x8 pandiagonal magic squares. Proceedings Royal Society London 407, 259–281 (1986)

    CrossRef  Google Scholar 

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

    Google Scholar 

  15. Puget, J.-F.: Elimination de symetries dans les problémes injectifs. To appear in proceedings of JFPC 2005 (2005) (in French)

    Google Scholar 

  16. Puget, J.-F.: Automatic detection of variable and value symmetries. To appear in the proceedings of CP 2005, Sitges (2005)

    Google Scholar 

  17. Regin, J.-C.: Modeling and Solving Sports League Scheduling with Constraint Programming, Informs, Montreal (April 1998)

    Google Scholar 

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

    Google Scholar 

  19. 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 

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

    Google Scholar 

  21. Seress, A.: Permutation Group Algorithms. Cambrige University Press, Cambrige (2003)

    MATH  CrossRef  Google Scholar 

  22. Van Hentenryck, P.: Constraint Satisfaction in Logic Programming. MIT Press, Cambridge (1989)

    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). Breaking All Value Symmetries in Surjection Problems. 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_37

Download citation

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

  • 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)