Commune · Histoire
Conflict-driven clause learning
SAT solving algorithm
In computer science, conflict-driven clause learning (CDCL) is an algorithm for solving the Boolean satisfiability problem (SAT). Given a Boolean formula, the SAT problem asks for an assignment of variables so that the entire formula evaluates to true.
Sur Wikipédia
Texte en anglais Pas encore d'article dans ta langue : extrait en anglais.
In computer science, conflict-driven clause learning (CDCL) is an algorithm for solving the Boolean satisfiability problem (SAT). Given a Boolean formula, the SAT problem asks for an assignment of variables so that the entire formula evaluates to true. Inspired by the DPLL algorithm, CDCL makes use of non-chronological backtracking (or backjumping), and adds new clauses to the clause database whenever a conflict occurs. Conflict-driven clause learning was proposed by Marques-Silva and Karem A. Sakallah (1996, 1999) and Bayardo and Schrag (1997).
Texte : Wikipédia en anglais, CC BY-SA 4.0. ·
