Skip to main content
SpringerLink
Log in

NuSBDS: An Easy to Use Symmetry Breaking System

  • Conference paper
Principles and Practice of Constraint Programming – CP 2003 (CP 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2833))

Abstract

Over the past few years we have seen a marked increase in the interest of symmetry breaking in constraint programming. Many new techniques have been introduced to deal with the problems that symmetrical CSPs create. Previous methods of symmetry breaking such as SBDS [1] and SBDD [2,3] require an explicit list of the symmetries of a CSP, or a dominance checker, respectively. Also, the GHK-SBDS method [4] of breaking symmetry requires the user to supply a generator set of a group representing the symmetries of the CSP.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Gent, I., Smith, B.: Symmetry breaking in constraint programming. In: Horn, W. (ed.) Proceedings of ECAI 2000, pp. 599–603. IOS Press, Amsterdam (2000)

    Google Scholar 

  2. Fahle, T., Schamberger, S., Sellman, M.: Symmetry breaking. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, pp. 93–107. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

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

    Chapter  Google Scholar 

  4. Gent, I., Harvey, W., Kelsey, T.: Groups and constraints: Symmetry breaking during search. In: Van Hentenryck, P. (ed.) Principles and Practice of Constraint Programming, pp. 415–430. Springer, Heidelberg (2002)

    Google Scholar 

  5. McDonald, I.: NuSBDS: An easy to use Symmetry Breaking System. Technical Report APES-61-2003, APES Research Group (July 2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science, University of St Andrews, Fife, Scotland

    Iain McDonald

Authors
  1. Iain McDonald
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Matematica Pura ed Applicata, Università di Padova, Via Trieste 63, 35121, Padova, Italy

    Francesca Rossi

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

McDonald, I. (2003). NuSBDS: An Easy to Use Symmetry Breaking System. In: Rossi, F. (eds) Principles and Practice of Constraint Programming – CP 2003. CP 2003. Lecture Notes in Computer Science, vol 2833. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45193-8_109

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-45193-8_109

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-45193-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation