CS359: Little Engines of Proof

Fall 2003

MW4:30-5.45 GATES 400

We survey the state of the art in automated deduction through a collection of useful algorithms and semi-algorithms. Topics include propositional satisfiability, ground decision procedures for equality and inequality, combination methods, quantifier elimination, rewriting, and proof search. The emphasis is on simple and unified theoretical foundations, efficient implementation, and novel applications. Our presentation includes recent research results and complements the contents of the Fall Quarter Logic Seminars. A basic background in logic and computation is adequate. The course should be of interest to graduate students in logic, computer science, and philosophy.