Weighted constraint satisfaction problem

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 constraints can be violated (according to a violation degree) and in which preferences 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 cost function) among multiple possible solutions.

Comment
enIn artificial intelligence and operations research, a Weighted Constraint Satisfaction Problem (WCSP) is a generalization of a constraint satisfaction problem (CSP) where some of the constraints can be violated (according to a violation degree) and in which preferences 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 cost function) among multiple possible solutions.
Has abstract
enIn artificial intelligence and operations research, a Weighted Constraint Satisfaction Problem (WCSP) is a generalization of a constraint satisfaction problem (CSP) where some of the constraints can be violated (according to a violation degree) and in which preferences 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 cost function) among multiple possible solutions.
Hypernym
Problem
Is primary topic of
Weighted constraint satisfaction problem
Label
enWeighted constraint satisfaction problem
Link from a Wikipage to an external page
costfunction.org/en/benchmark''').
www.cril.univ-artois.fr/~lecoutre/%23/benchmarks'''
forgemia.inra.fr/thomas.schiex/cost-function-library'''
genoweb.toulouse.inra.fr/~degivry/evalgm'''%3Cref%3EB
xcsp.org/series''').
www.ics.uci.edu/~dechter/software.html'''
miat.inrae.fr/toulbar2'''
Link from a Wikipage to another Wikipage
Artificial intelligence
Category:Constraint programming
Combinatorial explosion
Constraint (mathematics)
Constraint programming
Constraint satisfaction problem
File:TransfertsWCSP.pdf
Graphical model
Loss function
Operations research
Preference
Preference-based planning
SameAs
4xEZq
m.0ql42tn
Q7979896
Subject
Category:Constraint programming
WasDerivedFrom
Weighted constraint satisfaction problem?oldid=1045542898&ns=0
WikiPageLength
8736
Wikipage page ID
38408365
Wikipage revision ID
1045542898
WikiPageUsesTemplate
Template:Reflist