Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03300717n
Noun Named Entity
JA
No term available
EN
In computer science and mathematical logic, satisfiability modulo theories is the problem of determining whether a mathematical formula is satisfiable. 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