Abstract
We introduce a general framework for constraint satisfaction and optimization where classical CSPs, fuzzy CSPs, weighted CSPs, partial constraint satisfaction, and others can be easily cast. The framework is based on a semiring structure, where the carrier set of the semiring specifies the values to be associated with each tuple of values of the variable domain, and the two semiring operations (+ and ×) model constraint projection and combination respectively.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Bistarelli, S. (2004). 2. Soft Constraint Satisfaction Problems. In: Semirings for Soft Constraint Solving and Programming. Lecture Notes in Computer Science, vol 2962. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25925-1_2
Download citation
DOI: https://doi.org/10.1007/978-3-540-25925-1_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21181-5
Online ISBN: 978-3-540-25925-1
eBook Packages: Springer Book Archive