Revision as of 09:28, 18 November 2016 edit A3nm (talk \| contribs) Extended confirmed users, Pending changes reviewers 4,578 edits rewrite lead ← Previous edit		Revision as of 09:28, 18 November 2016 edit undo A3nm (talk \| contribs) Extended confirmed users, Pending changes reviewers 4,578 edits m typo Next edit →
Line 1: In [[artificial intelligence]] and [[operations research]], a '''Weighted Constraint Satisfaction Problem''' ('''WCSP''') 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 [[~~oss~~loss function\|cost function]]) among multiple possible solutions. ==Formal definition==

Weighted constraint satisfaction problem: Difference between revisions