Theoretical Computer Science
Synopsis
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. It features: a comprehensive review of SAT research work over the past 25 years; the most recent research results; and a spectrum of algorithmic issues and applications.
- Hakimiliki:
- 1997 Springer
Book Details
- Book Quality:
- ISBN-13:
- 9789811068935
- Publisher:
- Springer Singapore, Singapore
- Date of Addition:
- 2017-10-15T04:54:35Z
- Lugha:
- English
- Kategoria:
- Usage Restrictions:
- This is a copyrighted book.