Skip to main content

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4304))

Included in the following conference series:

Abstract

Symmetry occurs in many problems in aritifical intelligence. For example, in the n-queens problem, the chessboard can be rotated 90°. As a second example, several machines in a factory might have the same capacity. In a production schedule, we might therefore be able to swap the jobs on machines with the same capacity. As a third example, two people within a company might have the same skills. Given a staff roster, we might therefore be able to interchange these two people. And as a fourth example, when configuring a computer, two memory boards might be identical. We might therefore be able to swap them around without changing the performance of the computer.

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

Access this chapter

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. Puget, J.F.: On the satisfiability of symmetrical constrained satisfaction problems. In: Komorowski, J., Ras, Z. (eds.) ISMIS 1993. LNCS, vol. 689, pp. 350–361. Springer, Heidelberg (1993)

    Google Scholar 

  2. Crawford, J., Luks, G., Ginsberg, M., Roy, A.: Symmetry breaking predicates for search problems. In: Proceedings of the 5th International Conference on Knowledge Representation and Reasoning (KR 1996), pp. 148–159 (1996)

    Google Scholar 

  3. Walsh, T.: General symmetry breaking constraints. In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204, Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  4. Shlyakhter, I.: Generating effective symmetry-breaking predicates for search problems. In: Proceedings of LICS workshop on Theory and Applications of Satisfiability Testing (SAT 2001) (2001)

    Google Scholar 

  5. Flener, P., Frisch, A., Hnich, B., Kiziltan, Z., Miguel, I., Pearson, J., Walsh, T.: Breaking row and column symmetry in matrix models. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, Springer, Heidelberg (2002)

    Google Scholar 

  6. Law, Y., Lee, J.: Global constraints for integer and set value precedence. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 362–376. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  7. Walsh, T.: Symmetry breaking using value precedence. In: Proceedings of the 17th ECAI, European Conference on Artificial Intelligence, IOS Press, Amsterdam (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Walsh, T. (2006). Symmetry Breaking. In: Sattar, A., Kang, Bh. (eds) AI 2006: Advances in Artificial Intelligence. AI 2006. Lecture Notes in Computer Science(), vol 4304. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11941439_4

Download citation

  • DOI: https://doi.org/10.1007/11941439_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-49787-5

  • Online ISBN: 978-3-540-49788-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics