Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:00377420n
Noun Named Entity
JA
No term available
EN
In formal logic, Horn-satisfiability, or HORNSAT, is the problem of deciding whether a given set of propositional Horn clauses is satisfiable or not. Wikipedia
Relations
Sources
IS A
計算問題
NAMED AFTER
アルフレッド・ホーン

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