5. Higher Order Semiring-Based Constraints
- 283 Downloads
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.
KeywordsDynamic Programming Algorithm Unary Constraint Soft Constraint Syntactic Category Semantic Function
Unable to display preview. Download preview PDF.