Algorithms for Solving the Boolean Satisfiability (SAT) Problem and Their Applications to Combinatorial Problems

This talk will discuss the application of modern SAT-solving algorithms, commonly implemented in SAT solvers, to challenging problems arising in a variety of domains, including cryptography, Ramsey theory, symbolic verification, combinatorial search, and the synthesis of error-correcting codes.

Particular emphasis will be placed on recent results in which SAT-based methods were used to discover new error-correcting codes with greater error-correction capability than previously known codes having the same basic parameters.