Satisfiability Problem: Theory and Applications : DIMACS Workshop, March 11-13, 1996

Dingzhu Du · Jun Gu · Panos M. Pardalos

sij 1997. · Center for Discrete Mathematics and Theoretical Computer Science New Brunswick, NJ: DIMACS series in discrete mathematics and theoretical computer science · American Mathematical Soc.

O ovoj e-knjizi

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 applications of theoretical/algorithmic results to practical problems and presents practical examples for theoretical/algoritmic study. Major topics covered in the book include practical and industial 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.