Weighted constraint satisfaction problem: Difference between revisions

Content deleted Content added
No edit summary
No edit summary
Line 1:
Whereas all constraints in a Constraint Satisfaction Problem must be satisfiable, a Weighted Constraint Satisfaction Problem (WCSP) is a constraint satisfaction problem where constraints can be violated (according a violation degree) in which preferences among solutions can be expressed.
Introduction
 
==Formal definition==