A note on some collapse results of valued constraints
Bruno Zanuttini and Stanislav Živný
Abstract
Valued constraint satisfaction problem (VCSP) is an optimisation framework originally coming from Artificial Intelligence and generalising the classical constraint satisfaction problem (CSP). The VCSP is powerful enough to describe many important classes of problems. In order to investigate the complexity and expressive power of valued constraints, a number of algebraic tools have been developed in the literature. In this note we present alternative proofs of some known results without using the algebraic approach, but by representing valued constraints explicitly by combinations of other valued constraints.
Details
| Journal |
Information Processing Letters |
| Number |
11 |
| Pages |
534–538 |
| Volume |
109 |
| Year |
2009 |
Links
DOI (10.1016/j.ipl.2009.01.018)
Related pages
|
People |
|
|
Activities |