This page gives highlights of past lectures and provides lecture notes, reading assignments, and exercises.
Chapters and sections in readings are from these textbooks available electronically from the UIowa library:
| Dates | Topics | Readings | Slides |
|---|---|---|---|
| Jan 17 |
Course introduction and administration.
|
Syllabus |
Course Introduction |
| Jan 19 |
Introduction to formal logics and propositional logic. |
ML Ch 1 ML Ch 2.1-2.5 |
Propositional Logic Basics |
|
Jan 22 Jan 24 Jan 26 |
More on propositional logic. Proof systems. Tableaux-style and Hilbert style proof systems. Introduction to abstract proof systems. |
ML Ch 2.6-2.7
ML Ch 3.1-3.7 CC Ch 1.1-1.4 |
Propositional Logic Basics
Abstract Proof Systems |
|
Jan 29 Jan 31 Feb 1 |
Abstract proof systems. Soundness, completeness and termination. Proof strategies. Normal forms. |
CC 1.6-1.7 |
Abstract Proof Systems
Normal Forms |
|
Feb 5 Feb 7 Feb 9 |
DNF and CNF. Resolution. Decision procedures for SAT. The DP and the DPLL procedures. Abstract DPLL. |
ML 4.1-4.3, 4.5.1 ML 6.1-6.5 DP 2 |
Normal Forms
SAT Solving DPLL and CDCL |
|
Feb 12 Feb 14 Feb 16 |
From abstract DPLL to abstract CDCL. |
|
DPLL and CDCL
|
|
Feb 19 Feb 21 Feb 23 |
First-order logic. Syntax. Semantics. |
ML 7.1-3 |
FOL Syntax & Semantics
|
|
Feb 26 Feb 28 Mar 1 |
More on first-order logic. Entailment and validity in FOL. Invariance of truth values. The deduction and free constants theorems. Proof systems for FOL. |
ML 7.1-3 |
FOL Syntax & Semantics
FOL Proof Systems |
|
Mar 4 |
Proof systems for FOL. Proof examples. |
ML 9.2 | FOL Proof Systems |
|
Mar 6 |
Midterm I |
All previous readings | |
|
Mar 8 |
Normal form transformations. Clausal form. FOL resolution. |
ML 10.1-2 | FOL Proof Systems |
|
Mar 11 Mar 13 Mar 15 |
No class. Spring break |
||
|
Mar 18 Mar 20 Mar 22 |
First-order theories. Satisfiability modulo theories. Examples of first-order theories. Theory solvers. |
CC Ch. 3 DP Ch. 4 |
Satisfiability Modulo Theories
Theory solvers I |
|
Mar 25 Mar 27 Mar 29 |
Theory solvers for various theories in SMT. |
CC Ch. 3
DP |
Theory solvers I
Theory solvers II |
|
Apr 1 Apr 3 Apr 5 |
The Simplex method for LRA satisfiability. Theory solvers for strings. |
DP Ch. 5.1-5.2 |
Theory solvers II
Theory solvers III |
|
Apr 8 Apr 10 Apr 12 |
More on theory solvers for strings. Exercises. Combining theory solvers with a SAT solver. |
DP Ch. 3 |
Theory solvers III
Combining theory and SAT solvers |
|
Apr 15 Apr 17 |
From CDCL to CDCL modulo theories. |
DP Ch. 3 | Combining theory and SAT solvers |
| Apr 19 |
Midterm II |
All previous readings | |
|
Apr 22 Apr 24 Apr 26 |
Combining theories and their solvers. CDCL modulo multiple theories. |
CC Ch. 10 DP Ch. 10 |
Combining theory and their solvers |