Introduction to mathematics of satisfiability

Preface. Sets, Lattices, and Boolean Algebras. Introduction to Propositional Logic. Normal Forms. The Craig Lemma. Complete Sets of Functors. Compactness Theorem. Clausal Logic and Resolution. Algorithms for SAT. Easy Cases of SAT. SAT, Integer Programming, and Matrix Algebra. Coding Runs of Turing Machine, and "Mix-and-Match". Computational Knowledge Representation with SAT. Knowledge Representation and Constraint Satisfaction. Answer Set Programming. Conclusions. References. Index.