Constraint satisfaction and constraint programming have shown to be very simple but powerful ideas, with applications in various areas. Still, in the last ten years, the simple notion of constraints has shown some deficiencies concerning both theory and practice, typically in the way over-constrained problems and preferences are treated. For this reason, the notion of soft constraints has been introduced with semiring-based soft constraints and valued constraints being the two main general frameworks.
This book includes formal definitions and properties of semiring-based soft constraints, as well as their use within constraint logic programming and concurrent constraint programming. Moreover, the author shows how to adapt existing notions and techniques such as abstraction and interchangeability to the soft constraint framework and it is demonstrated how soft constraints can be used in some application areas, such as security.
Overall, this book is a great starting point for anyone interested in understanding the basics of semiring-based soft constraints.
|Soft constraint satisfaction problems||p. 21|
|Towards SCSPs solutions||p. 51|
|SCSP abstraction||p. 99|
|Higher order semiring-based constraints||p. 125|
|Soft CLP||p. 137|
|SCLP and generalized shortest path problems||p. 171|
|Soft concurrent constraint programming||p. 191|
|Interchangeability in soft CSPs||p. 213|
|SCSPs for modelling attacks to security protocols||p. 237|
|Conclusions and directions for future work||p. 263|
|Table of Contents provided by Blackwell. All Rights Reserved.|
Series: Lecture Notes in Computer Science,
Number Of Pages: 284
Published: 24th February 2004
Publisher: Springer-Verlag Berlin and Heidelberg Gmbh & Co. Kg
Country of Publication: DE
Dimensions (cm): 23.39 x 15.6 x 1.58
Weight (kg): 0.42