Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Weighted constraint satisfaction problem
open-in-new
<p>In <a href="/facts/Artificial_intelligence/lJGauQwX">artificial intelligence</a> and <a href="/facts/Operations_research/H5yJkV5n">operations research</a>, a Weighted Constraint Satisfaction Problem (WCSP), also known as Valued Constraint Satisfaction Problem (VCSP), is a generalization of a <a href="/facts/Constraint_satisfaction_problem/oKCeIV2L">constraint satisfaction problem</a> (CSP) where some of the <a href="/facts/Constraint_(mathematics)/QLFIFlFX">constraints</a> can be violated (according to a violation degree) and in which <a href="/facts/Preference/hWCEmfuX">preferences</a> 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 <a href="/facts/Loss_function/xv5ozuhl">cost function</a>) among multiple possible solutions. </p>