All talks held in Pacific Time.  *Schedule subject to change*

Monday: SAT SOLVING/PROOF COMPLEXITY

Tuesday: SAT SOLVING/PROOF COMPLEXITY

Wednesday: CP, OR, AND MORE

Thursday: VERIFIED COMPUTATION

Friday: BEYOND

–
Coffee and Check-in
–
Opening Remarks & Welcome
–
In Search of the Hard Instances
Albert Atserias (Universitat Politècnica de Catalunya)
–
Break
–
A Survey of Automatability
Robert Robere (McGill University)
–
On Bounded Depth Proofs For Tseitin Formulas On The Grid; Revisited
Kilian Risse (Ecole Polytechnique Fédérale de Lausanne (EPFL))
–
Lunch
–
CDCL SAT Solving and Applications to Optimization Problems
Alexander Nadel (Intel)
–
Break
–
IPASIR-UP: User Propagators for CDCL
Katalin Fazekas (TU Wien)
–
Designing Samplers is Easy: The Boon of Testers
Mate Soos (National University of Singapore)
–
Structure-guided Local Improvement for Maximum Satisfiability
André Schidler (TU Wien)
–
Reception
–
Coffee and Check-in
–
A Roadmap for the Next Phase of SAT Research
Karem Sakallah (University of Michigan)
–
Break
–
Isomorph-Free Generation Of Combinatorial Objects With Sat Modulo Symmetries
Stefan Szeider (TU Wien)
–
Beyond SAT - Proofs for QBF, and more
Meena Mahajan (Institute of Mathematical Sciences)
–
Lunch
–
The Proof Complexity of Integer Programming
Noah Fleming (Memorial University)
–
Break
–
Theoretical limits of 1UIP Learning
Marc Vinyals (University of Auckland)
–
Clique is hard on average for unary Sherali-Adams
Susanna F. de Rezende (Lund University)
–
Graph Colouring Is Hard on Average for Polynomial Calculus and Nullstellensatz
Shuo Pang (University of Copenhagen)
–
Coffee and Check-in
–
Logic, Optimization, and Constraint Programming: A Fruitful Collaboration
John Hooker (Carnegie Mellon University)
–
Break
–
ASP: Theory, Practice, and Beyond
Torsten Schaub (University of Potsdam)
–
Modern Constraint Programming, For People Who Know SAT
Ciaran McCreesh (University of Glasgow)
–
Lunch
–
Rado numbers: SAT methods and connections to Nullstellensatz complexity
William J. Wesley (UC Davis)
–
Exact Covering with Colours
Don Knuth (Stanford)
–
Break
–
Benefits of Abstract Modelling using Conjure
Özgür Akgün (University of St. Andrews)
–
Exploiting Combinatorial Structure in Constraint Programming: Beyond Domain Filtering to Counting and Marginals
Gilles Pesant (Polytechnique Montréal)
–
Coffee and Check-in
–
The Power of Extended Resolution: A Practitioner's Perspective
Randal Bryant (Carnegie Mellon University)
–
Break
–
Reactive Synthesis Empowered by Logical Reasoning
Rayna Dimitrova (CISPA Helmholtz Center for Information Security)
–
MCSat Approaches for Solving Non-linear Modular Arithmetic
Daniela Kaufmann (TU Wien)
–
Lunch
–
Trustworthy Automated Reasoning
Marijn Heule (Carnegie Mellon University)
–
Break
–
Certified Static and Dynamic Symmetry Breaking
Bart Bogaerts (Vrije Universiteit Brussel (VUB))
–
Proof Logging for MaxSAT – The Past, The Present and The Future
Jeremias Berg (University of Helsinki)
–
Proof Logging for Constraint Programming
Matthew McIlree (University of Glasgow)
–
Coffee and Check-in
–
Homomorphism Counts: Expressive Power and Query Algorithms
Phokion Kolaitis (UC Santa Cruz and IBM Research)
–
Break
–
Analysis of Core-Guided MaxSat Using Cores and Correction Sets
Nina Narodytska (VMware Research)
–
Proving UNSAT in Zero Knowledge
Ning Luo (Northwestern University)
–
Lunch
–
Knowledge Compilation for Quantification and Synthesis
Supratik Chakraborty (IIT Bombay)
–
Break
–
Explaining SAT Solving Using Causal Reasoning
Jiong Yang (National University of Singapore)
–
Unification of SAT, Constraint Programming, and Pseudo-Boolean Solving: A Personal Story
Emir Demirovic (TU Delft)
–
SAT Beyond Boolean Interpretations
Vinodchandran Variyam (University of Nebraska - Lincoln)