OXFORD UNIVERSITY COMPUTING LABORATORY

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.

info

book title

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

pages

798-805

series

Lecture Notes in Computer Science

volume

4741

year

2007

links

BibTeX

Link (pdf)

DOI (10.1007/978-3-540-74970-7_57)

related pages

people

activities

Random Image
Random Image
Random Image