The connection between constraint languages and clone theory has been a fruitful line of research on the complexity of constraint satisfaction problems. In a recent result, Cohen et al. [SICOMP’13] have characterised a Galois connection between valued constraint languages and so-called weighted clones. In this paper, we study the structure of weighted clones. We extend the results of Creed and Zivny from [CP’11/SICOMP’13] on types of weightings necessarily contained in every nontrivial weight...Expand abstract
- Publication status:
- Peer review status:
- Peer reviewed
- Publisher's version
- Copyright holder:
- Society for Industrial and Applied Mathematics
- © 2015 Society for Industrial and Applied Mathematics. This is the publisher's version of the article. The final version is available online from the Society for Industrial and Applied Mathematics at: [10.1137/140990346].