Skip to main content
SpringerLink
Log in

Dynamic Lex Constraints

  • Conference paper
Principles and Practice of Constraint Programming - CP 2006 (CP 2006)

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

Abstract

Symmetries are one of the difficulties constraint programming users have to deal with. One way to get rid of symmetries is to add lex constraints. However, it can adversely affect the efficiency of a tree search method if the lex constraints remove the solution that would have been found at the first place. We propose to use an alternative filtering algorithm which does not exclude the first solution. We present both a theoretical analysis and some experimental evidence that it is as efficient as lex constraints. We also show that its efficiency does not depend much on the variable ordering used in the tree search. Last, we show that it can prune more nodes than the SBDS method.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Backofen, R., Will, S.: Excluding Symmetries in Constraint-Based Search. In: Jaffar, J. (ed.) CP 1999. LNCS, vol. 1713, pp. 73–87. Springer, Heidelberg (1999)

    Google Scholar 

  2. Cohen, D., Jeavons, P.G., Jefferson, C., Petrie, K.E., Smith, B.M.: Symmetry Definitions for Constraint Satisfaction Problems. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 17–31. Springer, Heidelberg (2005)

    Chapter  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. Fahle, T., Schamberger, S., Sellmann, M.: Symmetry breaking. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, pp. 93–107. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

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

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

    Chapter  Google Scholar 

  7. 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–437. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  8. Gent, I.P., Smith, B.M.: Symmetry Breaking During Search in Constraint Programming. In: Proceedings of ECAI 2000, pp. 599–603 (2000)

    Google Scholar 

  9. ILOG: ILOG Solver 6.3. User Manual ILOG, S.A., Gentilly, France (July 2006)

    Google Scholar 

  10. Lustig, I.J., Puget, J.-F.: Program Does Not Equal Program: Constraint Programming and Its Relationship to Mathematical Programming. INTERFACES 31(6), 29–53 (2001)

    Google Scholar 

  11. Petrie, K., Smith, B.M.: Symmetry breaking in graceful graphs. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 930–934. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  12. Puget, J.-F.: On the Satisfiability of Symmetrical Constraint Satisfaction Problems. In: Komorowski, J., Raś, Z.W. (eds.) ISMIS 1993. LNCS, vol. 689, pp. 350–361. Springer, Heidelberg (1993)

    Google Scholar 

  13. Puget, J.-F.: Breaking symmetries in all different problems. In: Proceedings of IJCAI 2005, pp. 272–277 (2005)

    Google Scholar 

  14. Puget, J.-F.: Symmetry Breaking Revisited. Constraints 10(1), 23–46 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  15. Puget, J.-F.: Breaking All Value Symmetries in Surjection Problems. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 490–504. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  16. Puget, J.-F.: An Efficient Way of Breaking Value Symmetries. In: Proceedings of AAAI 2006 (to appear, 2006)

    Google Scholar 

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

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

    Book  MATH  Google Scholar 

  19. Smith, B.: Sets of Symmetry Breaking Constraints. In: Proceedings of SymCon 2005, the 5th International Workshop on Symmetry in Constraints (2005)

    Google Scholar 

  20. Smith, B.M.: Constraint Programming Models for Graceful Graphs. In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204, pp. 545–559. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. ILOG, 9 avenue de Verdun, 94253, Gentilly, France

    Jean-François Puget

Authors
  1. Jean-François Puget
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. LINA UMR CNRS 6241, University of Nantes,  

    Frédéric Benhamou

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Puget, JF. (2006). Dynamic Lex Constraints. In: Benhamou, F. (eds) Principles and Practice of Constraint Programming - CP 2006. CP 2006. Lecture Notes in Computer Science, vol 4204. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11889205_33

Download citation

  • DOI: https://doi.org/10.1007/11889205_33

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation