Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:02106418n
Noun Concept
EL
No term available
EN
In logic and computer science, the Davis–Putnam–Logemann–Loveland algorithm is a complete, backtracking-based search algorithm for deciding the satisfiability of propositional logic formulae in conjunctive normal form, i.e. for solving the CNF-SAT problem. Wikipedia
Relations
Sources
IS A
αλγόριθμος αναζήτησης
HAS PART
EN
unit propagation
AUTHOR
EN
Donald W. Loveland
Hilary Putnam
Martin Davis
EN
George Logemann
NAMED AFTER
EN
Donald W. Loveland
Hilary Putnam
Martin Davis
EN
George Logemann
SOLVES
boolean ικανοποιησιμότητα

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