Skip to main content

Acquiring Parameters of Implied Global Constraints

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

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

Abstract

This paper presents a technique for learning parameterized implied constraints. They can be added to a model to improve the solving process. Experiments on implied Gcc constraints show the interest of our approach.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Beldiceanu, N.: Global constraints as graph properties on a structured network of elementary constraints of the same type. In: Dechter, R. (ed.) CP 2000. LNCS, vol. 1894, pp. 52–66. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  2. Choco: A Java library for constraint satisfaction problems, constraint programming and explanation-based constraint solving (2005), http://sourceforge.net/projects/choco

  3. Colton, S., Miguel, I.: Constraint generation via automated theory formation. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, pp. 575–579. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  4. Frisch, A.M., Jefferson, C., Martinez Hernandez, B.: Ian Miguel. The rules of constraint modelling. In: Proceedings IJCAI (2005) (to appear)

    Google Scholar 

  5. Puget, J.F.: Constraint programming next challenge: Simplicity of use. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 5–8. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  6. Régin, J.-C.: Generalized arc consistency for global cardinality constraint. In: Proceedings AAAI, pp. 209–215 (1996)

    Google Scholar 

  7. Smith, B., Stergiou, K., Walsh, T.: Modelling the golomb ruler problem. In: Régin, J.C., Nuijten, W. (eds.) Proceedings IJCAI 1999 workshop on non-binary constraints, Stockholm, Sweden (1999)

    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

Bessiere, C., Coletta, R., Petit, T. (2005). Acquiring Parameters of Implied Global Constraints. 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_57

Download citation

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

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

Publish with us

Policies and ethics