Combining SAT and Computer Algebra for Circuit Verification

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

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

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

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

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

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

Torsten Schaub (University of Potsdam)
Maximum Satisfiability Solving

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

Bart Bogaerts (Vrije Universiteit Brussel)
Quantified Boolean Formulas

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

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

Aida Khajavirad (Lehigh University)