Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:02106418n
Noun Concept
Categories: SAT solvers, Automated theorem proving, Constraint programming
EN
DPLL algorithm  Davis-Logemann-Loveland algorithm  Davis-Putnam-Logeman-Loveland algorithm  Davis-Putnam-Logemann-Loveland algorithm  Davis–Putnam–Logemann–Loveland algorithm
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
Definitions
Relations
Sources
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
algorithm for solving the CNF-SAT problem Wikidata
IS A
search algorithm
HAS PART
unit propagation
AUTHOR
Donald W. Loveland
Hilary Putnam
Martin Davis
George Logemann
NAMED AFTER
Donald W. Loveland
Hilary Putnam
Martin Davis
George Logemann
SOLVES
Boolean satisfiability problem
Wikipedia
EN
DPLL algorithm
Wikidata
EN
DPLL algorithm
Wikipedia Redirections
EN
Davis-Logemann-Loveland algorithm, Davis-Putnam-Logeman-Loveland algorithm, Davis-Putnam-Logemann-Loveland algorithm, Davis–Putnam–Logemann–Loveland algorithm, DPLL-Algorithm
Wikidata Alias
EN
Davis-Putnam-Logemann-Loveland algorithm

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