Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:00377420n
Noun Named Entity
Categories: Satisfiability problems, P-complete problems, Logic in computer science
EN
Horn-satisfiability  Horn-SAT  Horn SAT  Horn satisfiability  HORNSAT
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
Definitions
Relations
Sources
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
Computational problem Wikidata
IS A
computational problem
NAMED AFTER
Alfred Horn
Wikipedia
EN
Horn-satisfiability
Wikidata
EN
Horn-satisfiability
Wikipedia Redirections
EN
Horn-SAT, Horn SAT, Horn satisfiability, HORNSAT
Wikidata Alias
EN
Horn-SAT, HORNSAT

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