Talk:Boolean satisfiability algorithm heuristics
| This is the talk page for discussing improvements to the Boolean satisfiability algorithm heuristics article. This is not a forum for general discussion of the article's subject. |
Article policies
|
| Find sources: Google (books · news · scholar · free images · WP refs) · FENS · JSTOR · TWL |
 | This article is rated C-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||
| |||||||||||
CDCL and DPLL[edit]
The CDCL article says:
The internal workings of CDCL SAT solvers were inspired by DPLL solvers. The main difference between CDCL and DPLL is that CDCL's backjumping is non-chronological.
That seems to contradict this article saying:
One of the cornerstone Conflict-Driven Clause Learning SAT solver algorithms is the DPLL algorithm.
Nowhere man (talk) 23:16, 7 January 2024 (UTC)