Propositional logic allows for description and then solving of a significant class of constraint satisfaction problems, namely those that require that thedomains of variables are finite. As such, propositional logic finds applications in describing problems stemmingfrom computer science, computer engineering and combinatorial optimization. But logic goes beyond just providing descriptive means - it is supported bymechanisms for computation of answers. At present there is a class of software systems, SAT solvers, that allow(given enough of resources) for solving problems expressed in propositionallogic. This book studies syntax, semantics, and algorithms for finding solutions ofproblems expressible in propositional logic. It is addressed to individuals whowant to understand the principles on which SAT solvers are based and gain adeeper understanding of techniques used in logic-based solving. | Introduction to Propositional Satisfiability by Victor Marek, Paperback | Indigo Chapters