Abstract
Substitutability and interchangeability in constraint satisfaction problems (CSPs) have been used as a basis for search heuristics, solution adaptation and abstraction techniques. In this chapter, we consider how the same concepts can be extended to soft constraint satisfaction problems (SCSPs).
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). 9. Interchangeability in Soft CSPs. 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_9
Download citation
DOI: https://doi.org/10.1007/978-3-540-25925-1_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21181-5
Online ISBN: 978-3-540-25925-1
eBook Packages: Springer Book Archive