Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03278571n
Noun Concept
JA
No term available
EN
In computer science, 2-satisfiability, 2-SAT or just 2SAT is a computational problem of assigning values to variables, each of which has two possible values, in order to satisfy a system of constraints on pairs of variables. 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