| 2022 | Classes of Hard Formulas for QBF Resolution. | Agnes Schleitzer, Olaf Beyersdorff |
| 2022 | Pedant: A Certifying DQBF Solver. | Franz-Xaver Reichl, Friedrich Slivovsky |
| 2022 | Incremental Maximum Satisfiability. | Andreas Niskanen, Jeremias Berg, Matti Jrvisalo |
| 2022 | Analysis of Core-Guided MaxSat Using Cores and Correction Sets. | Nina Narodytska, Nikolaj S. Bjrner |
| 2022 | Introducing Intel(R) SAT Solver. | Alexander Nadel |
| 2022 | A Generalization of the Satisfiability Coding Lemma and Its Applications. | Milan Moss, Harry Sha, Li-Yang Tan |
| 2022 | Changing Partitions in Rectangle Decision Lists. | Stefan Mengel |
| 2022 | QBF Merge Resolution Is Powerful but Unnatural. | Meena Mahajan, Gaurav Sood |
| 2022 | A SAT Attack on Rota's Basis Conjecture. | Markus Kirchweger, Manfred Scheucher, Stefan Szeider |
| 2022 | QBF Programming with the Modeling Language Bule. | Jean Christoph Jung, Valentin Mayer-Eichberger, Abdallah Saffidine |
| 2022 | Towards Learning Quantifier Instantiation in SMT. | Mikols Janota, Jelle Piepenbrock, Bartosz Piotrowski |
| 2022 | MaxSAT-Based Bi-Objective Boolean Optimization. | Christoph Jabs, Jeremias Berg, Andreas Niskanen, Matti Jrvisalo |
| 2022 | Tight Bounds for Tseitin Formulas. | Dmitry Itsykson, Artur Riazanov, Petr Smirnov |
| 2022 | Certified CNF Translations for Pseudo-Boolean Solving. | Stephan Gocht, Ruben Martins, Jakob Nordstrm, Andy Oertel |
| 2022 | On the Performance of Deep Generative Models of Realistic SAT Instances. | Ivn Garzn, Pablo Mesejo, Jess Girldez-Cru |
| 2022 | Weighted Model Counting with Twin-Width. | Robert Ganian, Filip Pokrvka, Andr Schidler, Kirill Simonov, Stefan Szeider |
| 2022 | Proofs for Propositional Model Counting. | Johannes Klaus Fichte, Markus Hecher, Valentin Roland |
| 2022 | Relating Existing Powerful Proof Systems for QBF. | Leroy Chew, Marijn J. H. Heule |
| 2022 | SAT-Based Leximax Optimisation Algorithms. | Miguel Cabral, Mikols Janota, Vasco Manquinho |
| 2022 | Migrating Solver State. | Armin Biere, Md. Solimul Chowdhury, Marijn J. H. Heule, Benjamin Kiesl, Michael W. Whalen |
| 2022 | Towards a SAT Encoding for Quantum Circuits: A Journey From Classical Circuits to Clifford Circuits and Beyond. | Lucas Berent, Lukas Burgholzer, Robert Wille |
| 2022 | On the Parallel Parameterized Complexity of MaxSAT Variants. | Max Bannach, Malte Skambath, Till Tantau |
| 2022 | A Comprehensive Study of k-Portfolios of Recent SAT Solvers. | Jakob Bach, Ashlin Iser, Klemens Bhm |
| 2022 | A New Exact Solver for (Weighted) Max#SAT. | Gilles Audemard, Jean-Marie Lagniez, Marie Miceli |
| 2022 | SAT Preprocessors and Symmetry. | Markus Anders |