Addressing a topic with over 80 years of history, this book provides a complete introduction to the mathematics of satisfiability. The text covers basic and more advanced subjects, such as propositional logic, complete sets of functors, normal forms of propositional formulas, and clausal logic. The author, oneof the main inventors of answer set programming, also includes algorithms fortesting satisfiability and discusses combinatorial circuits along with various classes of theories. Each chapter concludes with a set of exercises to confirm understanding of the concepts, making this work ideal for graduate studentsand researchers.
- ISBN: 978-1-4398-0167-3
- Editorial: Chapman & Hall/CRC Statistics and Mathem
- Encuadernacion: Cartoné
- Páginas: 360
- Fecha Publicación: 30/06/2009
- Nº Volúmenes: 1
- Idioma: Inglés