Please note that the times below are in Israel Daylight Time (GMT+3).

Time (GMT+3) Monday, August 1st
09:00-10:00 Friedrich Slivovsky: QBF Solvers and their Proof Systems
10:00-10:30 Benjamin Böhm: QCDCL with Cube Learning or Pure Literal Elimination – What is best?
10:30-11:00 Break
11:00-12:00 Leroy Chew: Strategy Extraction and Proof
12:00-12:30 Tomáš Peitl: QCDCL with Cube Learning or Pure Literal Elimination (Part 2)
12:30-14:00 Lunch Break
14:00-14:30 Joseph Reeves: Moving Definition Variables in Quantified Boolean Formulas
14:30-15:00 Michael Hartisch: Advances in Quantified Integer Programming
15:00-15:30 Priyanka Golia: A Data-Driven Approach for Boolean Functional Synthesis
15:30-16:00 Break
16:00-16:30 Abdallah Saffidine: From QBF to the Dynamic Logic of Propositional Assignments and back: A computational Perspective
16:30-17:00 Markus Hecher: Lower Bounds for QBFs of Bounded Treewidth