Skip to main content
SpringerLink
Log in

Symmetry Breaking in Numeric Constraint Problems

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

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

Abstract

Symmetry-breaking constraints in the form of inequalities between variables have been proposed for a few kind of solution symmetries in numeric CSPs. We show that, for the variable symmetries among those, the proposed inequalities are but a specific case of a relaxation of the well-known \(\textsc{lex}\) constraints extensively used for discrete CSPs. We discuss the merits of this relaxation and present experimental evidences of its practical interest.

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 109.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 149.00
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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Cohen, D., Jeavons, P., Jefferson, C., Petrie, K., Smith, B.: Symmetry definitions for constraint satisfaction problems. Constraints 11(2-3), 115–137 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  2. COPRIN: The inria project COPRIN examples webpage (2011), http://www-sop.inria.fr/coprin/logiciels/ALIAS/Benches/

  3. Costa, A., Liberti, L., Hansen, P.: Formulation symmetries in circle packing. Electronic Notes in Discrete Mathematics 36, 1303–1310 (2010)

    Article  MATH  Google Scholar 

  4. Crawford, J., Ginsberg, M., Luks, E., Roy, A.: Symmetry-breaking predicates for search problems. In: KR, pp. 148–159 (1996)

    Google Scholar 

  5. Flener, P., Frisch, A., Hnich, B., Kiziltan, Z., Miguel, I.: Breaking row and column symmetries in matrix models. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 462–476. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  6. Gasca, R., Valle, C.D., Cejudo, V., Barba, I.: Improving the computational efficiency in symmetrical numeric constraint satisfaction problems. In: Marín, R., Onaindía, E., Bugarín, A., Santos, J. (eds.) CAEPIA 2005. LNCS (LNAI), vol. 4177, pp. 269–279. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  7. Gent, I., Petrie, K., Puget, J.-F.: Symmetry in constraint programming. In: Handbook of Constraint Programming, pp. 329–376. Elsevier, Amsterdam (2006)

    Chapter  Google Scholar 

  8. Gent, I.P.: Groups and constraints: Symmetry breaking during search. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 415–430. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  9. Goldsztejn, A., Lebbah, Y., Michel, C., Rueher, M.: Capabilities of constraint programming in safe global optimization. In: International Symposium on Nonlinear Theory and its Applications, pp. 601–604 (2008)

    Google Scholar 

  10. Granvilliers, L., Benhamou, F.: Algorithm 852: Realpaver: an interval solver using constraint satisfaction techniques. ACM T. on Mathematical Software 32, 138–156 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  11. Ji, X., Ma, F., Zhang, J.: Solving global unconstrained optimization problems by symmetry-breaking. In: 8th IEEE/ACIS International Conference on Computer and Information Science, pp. 107–111 (2009)

    Google Scholar 

  12. Margot, F.: Symmetry in integer linear programming. In: 50 Years of Integer Programming 1958-2008, pp. 647–686. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  13. Merlet, J.-P.: Interval analysis for certified numerical solution of problems in robotics. Applied Mathematics and Computer Science 19(3), 399–412 (2009)

    MATH  Google Scholar 

  14. Meseguer, P., Torras, C.: Exploiting symmetries within constraint satisfaction search. Artif. Intell. 129(1-2), 133–163 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  15. Puget, J.F.: Breaking symmetries in all different problems. In: Proc. 19th International Joint Conference on Artificial Intelligence (IJCAI), pp. 272–277 (2005)

    Google Scholar 

  16. Puget, J.-F.: Symmetry breaking revisited. Constraints 10(1), 23–46 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  17. Ruiz de Angulo, V., Torras, C.: Exploiting single-cycle symmetries in continuous constraint problems. Journal of Artificial Intelligence Research 34, 499–520 (2009)

    MathSciNet  MATH  Google Scholar 

  18. Vu, X.H., Schichl, H., Sam-Haroud, D.: Interval propagation and search on directed acyclic graphs for numerical constraint solving. J. Global Optimization 45(4), 499–531 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  19. Walsh, T.: Parameterized complexity results in symmetry breaking. In: Raman, V., Saurabh, S. (eds.) IPEC 2010. LNCS, vol. 6478, pp. 4–14. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Université de Nantes/CNRS LINA (UMR-6241), 2 rue de la Houssinière, Nantes, F-44300, France

    Alexandre Goldsztejn & Christophe Jermann

  2. Institut de Robòtica i Informàtica Industrial (CSIC-UPC), Llorens i Artigas 4-6, 08028, Barcelona, Spain

    Vicente Ruiz de Angulo & Carme Torras

Authors
  1. Alexandre Goldsztejn
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Christophe Jermann
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Vicente Ruiz de Angulo
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Carme Torras
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, The Chinese University of Hong Kong, Shatin, N.T., Hong Kong, China

    Jimmy Lee

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Goldsztejn, A., Jermann, C., Ruiz de Angulo, V., Torras, C. (2011). Symmetry Breaking in Numeric Constraint Problems. In: Lee, J. (eds) Principles and Practice of Constraint Programming – CP 2011. CP 2011. Lecture Notes in Computer Science, vol 6876. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23786-7_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-23786-7_25

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-23785-0

  • Online ISBN: 978-3-642-23786-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation