DIMACS - Series in Discrete Mathematics and Theoretical Computer Science
Volume: 35; 1997; 724 pp; Hardcover
MSC: Primary 03; 90; 68;
Print ISBN: 978-0-8218-0479-7
Product Code: DIMACS/35
List Price: $191.00
Individual Member Price: $152.80
Satisfiability Problem: Theory and ApplicationsShare this page
Edited by Dingzhu Du; Jun Gu; Panos M. Pardalos
A co-publication of the AMS and DIMACS
The satisfiability (SAT) problem is central in mathematical logic, computing theory, and many industrial applications. There has been a strong relationship between the theory, the algorithms, and the applications of the SAT problem. This book aims to bring together work by the best theorists, algorithmists, and practitioners working on the SAT problem and on industrial applications, as well as to enhance the interaction between the three research groups. The book features the application of theoretical/algorithmic results to practical problems and presents practical problems for theoretical/algorithmic study.
Major topics covered in the book include practical and industrial SAT problems and benchmarks, significant case studies and applications of the SAT problem and SAT algorithms, new algorithms and improved techniques for satisfiability testing, specific data structures and implementation details of the SAT algorithms, and the theoretical study of the SAT problem and SAT algorithms.
A comprehensive review of SAT research work over the past 25 years.
The most recent research results.
A spectrum of algorithmic issues and applications.
Co-published with the Center for Discrete Mathematics and Theoretical Computer Science beginning with Volume 8. Volumes 1–7 were co-published with the Association for Computer Machinery (ACM).
Table of Contents
Table of Contents
Satisfiability Problem: Theory and Applications
Graduate students and research mathematicians interested in computer science, mathematics, engineering, and operations research.