All times are listed in PST.

–
Introductions
–
SAT-Centered Complexity Theory
Valentine Kabanets (Simon Fraser University)
–
SAT-Solving
Armin Biere (Johannes Kepler University)
–
Proof Complexity
Sam Buss (UC San Diego)
–
Pseudo-Boolean Solving and Optimization
Jakob Nordström (University of Copenhagen & Lund University)
–
Approximate Counting and Sampling
Kuldeep Meel (National University of Singapore)
–
Programming Z3
Nikolaj Björner (Microsoft Research)
–
Using SAT Solvers to Prevent Causal Failures in the Cloud
Ruzica Piskac (Yale University)