The satisfiability (SAT) problem is central in mathematical logic, computing theory, and many industrial application problems. There has been a strong relationship between the theory, algorithms, and the applications of the SAT problem. The main focus of this workshop is to bring together the best theorists, algorithmists, and practitioners working on the SAT problem and on the industrial applications involving the SAT problem, enhancing the interaction between the three research groups. This workshop will feature the application of theoretical/algorithmic results to practical problems as well as the presentation of practical problems for theoretical/algorithmic study. Major topics to be covered in the workshop include practical and industrial SAT problems and benchmarks, significant case studies and practical applications of 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.
The workshop will feature a keynote address by distinguished speaker, Professor Stephen Cook, 1982 Turing Award winner.
As an important activity of the workshop, a set of SAT problem benchmarks derived from the practical industrial engineering applications will be provided for SAT algorithm benchmarking.
Additional information on travel and local accommodations will be provided at a later date. More information on the workshop can be obtained from the organizers and Pat Toci (firstname.lastname@example.org) at DIMACS.