This webpage is a guide to further reading material, if you wish to go a little deeper or consider a different perspective of topics presented during the semester. It is an evolving guide, with constant additions to complement material presented in lecture.
Boolean Satisfiability: From Theoretical Hardness to Practical Success, by S. Malik and L. Zhang (click here).
A Primer on Boolean Satisfiability, by Emina Torlak (click here).
MOOC (Massive Open Online Course) with SAT/SMT Solvers, by Hans Zantema (click here).
Formal Modeling with Propositional Logic, by A. Kfoury (click here).
Donald Knuth on Binary Decision Diagrams (BDD's) (click here).
Formal Modeling with Quantified Boolean Formulas (QBF's), by A. Kfoury (click here).
Exercises in First-Order Definability, by A. Kfoury (click here).
Formal Proof Systems for First-Order Logic, by A. Kfoury (click here).
Compactness and Completeness Theorems of Propositional and First-Order Logic, by A. Kfoury (click here).
Tools for Automated and Semi-Automated Formal Reasoning, by A. Kfoury (click here).
Stay Tuned: More Coming Periodically!