Skip to main content

Optimising the Representation and Evaluation of Semiring Combination Constraints

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

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2833))

  • 1087 Accesses

Abstract

Classical constraint satisfaction problems (CSPs) provide an expressive formalism for modeling and solving many real-world problems. However, classical CSPs prove to be restrictive in any situation where uncertainty, fuzziness, probability, optimisation or partial satisfaction are intrinsic. Soft constraints alleviate many of the restrictions which classical constraint satisfaction impose. In particular, soft constraints provide a basis for capturing notions such as vagueness, uncertainty and cost in the CSP model.

This work has received support from Enterprise Ireland under their Basic Research Grant Scheme (Grant Number SC/02/289).

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. Bistarelli, S.: Soft Constraint Solving and programming: a general framework. PhD thesis, Dipartimento di Informatica, Università di Pisa, Italy (March 2001) TD-2/01

    Google Scholar 

  2. Bistarelli, S., Montanari, U., Rossi, F.: Constraint Solving over Semirings. In: Proc. IJCAI 1995, San Francisco, CA, USA (1995)

    Google Scholar 

  3. Bistarelli, S., Montanari, U., Rossi, F.: Semiring-based Constraint Solving and Optimization. Journal of the ACM 44(2), 201–236 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  4. Bistarelli, S., Montanari, U., Rossi, F.: Soft concurrent constraint programming. In: Le Métayer, D. (ed.) ESOP 2002. LNCS, vol. 2305, pp. 53–67. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kelleher, J., O’Sullivan, B. (2003). Optimising the Representation and Evaluation of Semiring Combination Constraints. In: Rossi, F. (eds) Principles and Practice of Constraint Programming – CP 2003. CP 2003. Lecture Notes in Computer Science, vol 2833. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45193-8_102

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-45193-8_102

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20202-8

  • Online ISBN: 978-3-540-45193-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics