Computing Science THE EXPRESSIVE POWER OF VALUED CONSTRAINTS: HIERARCHIES AND COLLAPSES

In this paper we investigate the ways in which a fixed collection of valued con-straints 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.