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".
Carnegie Mellon University
Spring 2022
This course is about software verification, with the goal of writing bug-free code. Students will learn to formalize program correctness, write verified code, and use automated tools for verification. It explores the principles behind verification tools, logical specifications, and deductive reasoning. Previous knowledge in program correctness reasoning is beneficial.
No concepts data
+ 22 more concepts