Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:14316867n
Noun Concept
JA
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
IS A
制約充足問題

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License