Jump to content

Talk:Boolean satisfiability algorithm heuristics

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia

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)[reply]