Abstract
Semiring-based constraint problems (SCSPs), as described in Chapter 2, extend classical constraint problems (CSPs) by allowing preferences, costs, priorities, probabilities, and other soft features. They are based over the notion of a semiring, that is, a set plus two operations. In this chapter we introduce a uniform, abstract presentation of (soft) constraint satisfaction concepts and constructions. Moreover, the soft constraint environment is enriched with the operation of function abstraction and application that can suitably be used to give modularity and compositionality to the framework. Finally, a small language is defined and used to represent and give semantics to general local propagation and dynamic programming algorithms.
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). 5. Higher Order Semiring-Based Constraints. 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_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-25925-1_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21181-5
Online ISBN: 978-3-540-25925-1
eBook Packages: Springer Book Archive