Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Conflict-driven clause learning
open-in-new
<p>In <a href="/facts/Computer_science/lN3pEyPz">computer science</a>, conflict-driven clause learning (CDCL) is an algorithm for solving the <a href="/facts/Boolean_satisfiability_problem/wBVRjWoy">Boolean satisfiability problem</a> (SAT). Given a Boolean formula, the SAT problem asks for an assignment of variables so that the entire formula evaluates to true. The internal workings of CDCL SAT solvers were inspired by <a href="/facts/DPLL_algorithm/T3Tu45j3">DPLL solvers</a>. The main difference between CDCL and DPLL is that CDCL's <a href="/facts/Backjumping/MhD7VLNK">backjumping</a> is non-chronological. </p><p>Conflict-driven clause learning was proposed by Marques-Silva and <a href="/facts/Karem_A._Sakallah/2EMMQnQ4">Karem A. Sakallah</a> (1996, 1999) and Bayardo and Schrag (1997). </p>