The expressive power of valued constraints: hierarchies and collapses
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....
Main Authors: | , , |
---|---|
Format: | Report |
Published: |
Computing Laboratory‚ University of Oxford
2015
|
_version_ | 1826275544104173568 |
---|---|
author | Cohen, D Jeavons, P Živný, S |
author_facet | Cohen, D Jeavons, P Živný, S |
author_sort | Cohen, D |
collection | OXFORD |
description | 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. |
first_indexed | 2024-03-06T23:00:19Z |
format | Report |
id | oxford-uuid:61e309eb-9266-486b-9b21-5a97c05082c8 |
institution | University of Oxford |
last_indexed | 2024-03-06T23:00:19Z |
publishDate | 2015 |
publisher | Computing Laboratory‚ University of Oxford |
record_format | dspace |
spelling | oxford-uuid:61e309eb-9266-486b-9b21-5a97c05082c82022-03-26T18:02:44ZThe expressive power of valued constraints: hierarchies and collapsesReporthttp://purl.org/coar/resource_type/c_93fcuuid:61e309eb-9266-486b-9b21-5a97c05082c8Department of Computer ScienceComputing Laboratory‚ University of Oxford2015Cohen, DJeavons, PŽivný, SIn 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. |
spellingShingle | Cohen, D Jeavons, P Živný, S The expressive power of valued constraints: hierarchies and collapses |
title | The expressive power of valued constraints: hierarchies and collapses |
title_full | The expressive power of valued constraints: hierarchies and collapses |
title_fullStr | The expressive power of valued constraints: hierarchies and collapses |
title_full_unstemmed | The expressive power of valued constraints: hierarchies and collapses |
title_short | The expressive power of valued constraints: hierarchies and collapses |
title_sort | expressive power of valued constraints hierarchies and collapses |
work_keys_str_mv | AT cohend theexpressivepowerofvaluedconstraintshierarchiesandcollapses AT jeavonsp theexpressivepowerofvaluedconstraintshierarchiesandcollapses AT zivnys theexpressivepowerofvaluedconstraintshierarchiesandcollapses AT cohend expressivepowerofvaluedconstraintshierarchiesandcollapses AT jeavonsp expressivepowerofvaluedconstraintshierarchiesandcollapses AT zivnys expressivepowerofvaluedconstraintshierarchiesandcollapses |