# The expressive power of valued constraints: Hierarchies and collapses

*David A. Cohen‚ Peter G. Jeavons and Stanislav Živný*

### 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.

Book Title

Proceedings of the 13th International Conference on Principles and Practice of Constraint Programming (CP'07)

Pages

798−805

Series

Lecture Notes in Computer Science

Volume

4741

Year

2007