bn:14316867n
Noun Concept
SYL
No term available
EN
In artificial intelligence and operations research, a Weighted Constraint Satisfaction Problem is a generalization of a constraint satisfaction problem where some of the constraints can be violated and in which preferences among solutions can be expressed. Wikipedia
Relations
Sources