Skip to main content

SOGgy Constraints: Soft Open Global Constraints

  • Conference paper

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

Abstract

We investigate soft open constraints. We generalize and unify classes of soft constraints and adapt them to the open setting. We give sufficient conditions for generalized classes of decomposition-based and edit-based soft constraints to be contractible. Finally, we outline a propagator for an open generalized edit-based soft Regular constraint.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Barták, R.: Dynamic Global Constraints in Backtracking Based Environments. Annals of Operations Research 118, 101–119 (2003)

    Article  MathSciNet  MATH  Google Scholar 

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

  3. Beldiceanu, N., Carlsson, M., Rampon, J.-X.: Global Constraint Catalog, SICS Technical Report T2005:08. Current version, http://www.emn.fr/x-info/sdemasse/gccat/

  4. Beldiceanu, N., Petit, T.: Cost Evaluation of Soft Global Constraints. In: Régin, J.-C., Rueher, M. (eds.) CPAIOR 2004. LNCS, vol. 3011, pp. 80–95. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  5. Bessière, C., Hebrard, E., Hnich, B., Kiziltan, Z., Walsh, T.: SLIDE: a useful special case of the CardPath constraint. In: ECAI 2008, pp. 475–479 (2008)

    Google Scholar 

  6. Dechter, R.: Constraint Processing. Morgan Kaufmann, San Francisco (2003)

    MATH  Google Scholar 

  7. van Hoeve, W.-J., Pesant, G., Rousseau, L.-M.: On Global Warming: Flow-Based Soft Global Constraints. Journal of Heuristics 12(4-5), 347–373 (2006)

    Article  MATH  Google Scholar 

  8. van Hoeve, W.-J., Régin, J.-C.: Open Constraints in a Closed World. In: Beck, J.C., Smith, B.M. (eds.) CPAIOR 2006. LNCS, vol. 3990, pp. 244–257. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  9. Maher, M.J.: Analysis of a Global Contiguity Constraint. In: Proc. Workshop on Rule-Based Constraint Reasoning and Programming (2002)

    Google Scholar 

  10. Maher, M.J.: Open Contractible Global Constraints. In: IJCAI 2009, pp. 578–583 (2009)

    Google Scholar 

  11. Maher, M.J.: Open Constraints in a Boundable World. In: van Hoeve, W.J., Hooker, J.N. (eds.) CPAIOR 2009. LNCS, vol. 5547, pp. 163–177. Springer, Heidelberg (2009)

    Google Scholar 

  12. Maher, M., Narodytska, N., Quimper, C.-G., Walsh, T.: Flow-based propagators for the SEQUENCE and related global constraints. In: Stuckey, P.J. (ed.) CP 2008. LNCS, vol. 5202, pp. 159–174. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  13. Pesant, G.: A Regular Language Membership Constraint for Finite Sequences of Variables. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 482–495. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  14. Petit, T., Régin, J.-C., Bessière, C.: Specific filtering algorithms for over-constrained problems. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, pp. 451–463. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  15. Rossi, F., van Beek, P., Walsh, T. (eds.): Handbook of Constraint Programming. Elsevier, Amsterdam (2006)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Maher, M.J. (2009). SOGgy Constraints: Soft Open Global Constraints. In: Gent, I.P. (eds) Principles and Practice of Constraint Programming - CP 2009. CP 2009. Lecture Notes in Computer Science, vol 5732. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04244-7_46

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-04244-7_46

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics