Skip to main content

Relaxation of Soft Constraints Via a Unified Semiring

  • Conference paper
  • 2663 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4013))

Abstract

The semiring framework for constraint satisfaction allows us to model a wide variety of problems of choice. Semiring constraint satisfaction problems are able to represent both classical consistency and optimisation problems, as well as soft constraint problems such as valued and weight CSPs. In this paper we pose and answer the question: how can we represent and ‘solve’ the relaxation of a semiring constraint satisfaction problem?

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   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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. Bistarelli, S., Freuder, E.C., O’Sullivan, B.: Encoding partial constraint satisfaction in the semiring-based framework for soft constraints. In: ICTAI, pp. 240–245. IEEE Computer Society, Los Alamitos (2004)

    Google Scholar 

  2. Bistarelli, S., Montanari, U., Rossi, F.: Constraint solving over semirings. In: IJCAI (1), pp. 624–630 (1995)

    Google Scholar 

  3. Bistarelli, S., Montanari, U., Rossi, F.: Semiring-based constraint logic programming. In: IJCAI (1), pp. 352–357 (1997)

    Google Scholar 

  4. Bistarelli, S., Montanari, U., Rossi, F.: Semiring-based constraint satisfaction and optimization. J. ACM 44(2), 201–236 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  5. Bistarelli, S., Montanari, U., Rossi, F., Schiex, T., Verfaillie, G., Fargier, H.: Semiring-based csps and valued csps: Frameworks, properties, and comparison. Constraints 4(3), 199–240 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  6. Leenen, L., Meyer, T.A., Ghose, A.K.: Relaxations of semiring constraint satisfaction problems. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, Springer, Heidelberg (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Harvey, P., Ghose, A. (2006). Relaxation of Soft Constraints Via a Unified Semiring. In: Lamontagne, L., Marchand, M. (eds) Advances in Artificial Intelligence. Canadian AI 2006. Lecture Notes in Computer Science(), vol 4013. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11766247_11

Download citation

  • DOI: https://doi.org/10.1007/11766247_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-34628-9

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics