Journal article

The expressive power of valued constraints: Hierarchies and collapses

Abstract:
In this paper we investigate the ways in which a fixed collection of valued constraints can be combined to express other valued constraints. We show that in some cases a large class of valued constraints, of all possible arities, can be expressed by using valued constraints of a fixed finite arity. We also show that some simple classes of valued constraints, including the set of all monotonic valued constraints with finite cost values, cannot be expressed by a subset of any fixed finite arity, and hence form an infinite hierarchy.

Access Document

Publisher copy:
10.1016/j.tcs.2008.08.036

Authors

Journal:
Theoretical Computer Science
Volume:
409
Issue:
1
Pages:
137-153
Publication date:
2008-01-01
DOI:
URN:
uuid:e39fb96f-cfdd-44b8-b36e-7462c299863d
Local pid:
cs:2696