Content deleted Content added
m →Resolution of n-ary WCSPs: {{sup}} |
m added VCSPs as something as which it is also known. Valued CSPs already redirects here, and in many of the sources of this article it is also called Valued CSP |
||
Line 1:
In [[artificial intelligence]] and [[operations research]], a '''Weighted Constraint Satisfaction Problem''' ('''WCSP'''), also known as '''Valued Constraint Satisfaction Problem''' ('''VCSP'''), is a generalization of a [[constraint satisfaction problem]] (CSP) where some of the [[constraint (mathematics)|constraint]]s can be violated (according to a violation degree) and in which [[preference]]s among solutions can be expressed. This generalization makes it possible to represent more real-world problems, in particular those that are over-constrained (no solution can be found without violating at least one constraint), or those where we want to find a minimal-cost solution (according to a [[loss function|cost function]]) among multiple possible solutions.
==Formal definition==
| |||