Conflict-driven clause learning (CDCL) is an algorithm for solving the Boolean satisfiability problem (SAT). It was proposed by Marques-Silva and Sakallah (1996, 1999) and Bayardo and Schrag (1997). The main difference between CDCL and DPLL, which it was inspired by, is that CDCL's back jumping is non-chronological.
Stanford University
Fall 2019
This course emphasizes SAT and SMT technology and its applications, offering an understanding of theoretical foundations and how to implement a small theory solver. Applications of SAT/SMT technology in the context of verification are also covered. The advanced topics and lack of specified prerequisites suggest this is a high-level course.
No concepts data
+ 20 more concepts