The DPLL algorithm is a complete search algorithm for deciding the satisfiability of propositional logic formulae in conjunctive normal form. It was introduced in 1961 by Martin Davis, George Logemann and Donald W. Loveland and is an improvement of the earlier Davis–Putnam algorithm. It is also known as the "Davis–Putnam method" or the "DP algorithm".

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