DPLL algorithm
Summary
In logic and computer science, the Davis–Putnam–Logemann–Loveland (DPLL) 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.
Further reading
- Wikipedia, page 2745094, revision 1341870655, DPLL algorithm. adopted
About this page
| Tag | K7R9D390SP |
|---|---|
| URI | m2://K7R9D390SP |
| Aliases | davis-logemann-loveland-algorithm, davis-putnam-logeman-loveland-algorithm, davis-putnam-logemann-loveland, davis-putnam-logemann-loveland-algorithm |
| Kind | concept |
| Writing | W1 stated |
| Same as | |
| Changed | 4 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge defines in: at least one definition (0 of 1)
- edge instance_of in: at least two examples (0 of 2)
- edge not_instance_of in: at least one non-example (0 of 1)
- edge specializes both: the more general notions and the special cases (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.