–
The Rise of Approximate Model Counting: Beyond Classical Theory and Practice of SAT

Kuldeep Meel (National University of Singapore)
Video
–
Combining SAT and Computer Algebra for Circuit Verification

Daniela Kaufmann (Johannes Kepler University Linz)
Video
–
Deep Dive into CDCL Pseudo-Boolean Solvers (focusing on the implementation in Sat4j)

Romain Wallon (Laboratoire d'informatique de l'École polytechnique) & Daniel Le…
Video
–
Beyond NP with Tractable Circuits

Adnan Darwiche (UCLA)
Video
–
What Maximum Clique Algorithms Can Teach Us, And Vice-Versa

Ciaran Mccreesh (University of Glasgow)
Video
–
Knowledge Compilation for Boolean Functional Synthesis

Supratik Chakraborty (IIT Bombay)
Video
–
Exact Mixed-Integer Programming over the Rational Numbers

Ambros Gleixner (Zuse Institute Berlin and HTW Berlin)
Video
–
Answer Set Programming in a Nutshell

Torsten Schaub (University of Potsdam)
Video
–
Maximum Satisfiability Solving

Jeremias Berg (University of Helsinki), Matti Järvisalo (University of Helsinki…
Video
–
Step-Wise Explanations for Constraint Programs

Bart Bogaerts (Vrije Universiteit Brussel)
Video
–
Quantified Boolean Formulas

Martina Seidl (Johannes Kepler University Linz), Florian Lonsing (Stanford Univ…
Video
–
Towards ML for Quantification in SMT

Mikoláš Janota (Czech Technical University)
Video
–
The Multilinear Polytope for Acyclic Hypergraphs

Aida Khajavirad (Lehigh University)
Video