There will be two invited talks and 12 regular talks.
All talks will take place in building 2 room C5.02.
| 9:00 | Session 1 - Pragmatics of QBF |
| 9:00 | Invited Talk: Dependency Schemes from Antiquity to Modernity Tomáš Peitl |
| 9:40 | Certification of True QBF Formulas in Expansion-Based Solving Sidhant Bhavnani, Clemens Hofstadler, Martina Seidl |
| 10:00 | Solving Connect Four with QBF: The Progress So Far Valentin Mayer-Eichberger, Abdallah Saffidine |
| 10:20 | Coffee Break |
| 10:50 | Session 2 - Dependency QBF |
| 10:50 | Strengthening the Implication-Free DQBF Dependency Scheme Ralf Wimmer, Christoph Scholl, Franz-Xaver Reichl |
| 11:10 | Symmetry Breaking in Dependency Quantified Boolean Formulas Paul Seip, Clemens Hofstadler, Manuel Kauers, Martina Seidl |
| 11:30 | On the Practicality of DQBF Solving for Succinctly Represented Graph Problems Chen-Ching Nieh, Chi-Kit Ng, Jie-Hong R. Jiang, Tony Tan |
| 11:50 | QBF Gallery Martina Seidl, Cynthia Peyrer, Luca Pulina |
| 12:10 | Lunch |
| 14:00 | Session 3 - QBF Proof Complexity (PC and QBF Joint Session) |
| 14:00 | Invited Talk: The Complexity of Quantified CDCL Benjamin Böhm |
| 14:40 | Quantified CDCL and Dependency Schemes: A proof-theoretic study Abhimanyu Choudhury, Meena Mahajan |
| 15:00 | A Boolean static proof system for Quantified Boolean Formulas (PC submission) Jan Johannsen, Marc Vinyals |
| 15:20 | A QBF-like Fragment of EPR Leroy Chew, Mikoláš Janota, Martin Suda, Miroslav Olšák |
| 15:40 | Coffee Break |
| 16:10 | Session 4 - QBF Counting, Sampling and Synthesis |
| 16:10 | On Knowledge Compilation Languages for QBFs Sravanthi Chede, Vaibhav Krishan, Swagato Sanyal, Anil Shukla |
| 16:30 | Solution-based QBF Equivalences And How To Check Them Peter Pfeiffer |
| 16:50 | Exploring Toda's Theorem as a QBF Solver Dror Fried, Etay Segal, Gad E. Yaron |
| 17:10 | Revisiting Encodings of Bounded Synthesis Che Cheng, Long-Hin Fung, Jie-Hong Roland Jiang, Friedrich Slivovsky, Tony Tan |
| 17:30 | End |