| 2022 | 25th International Conference on Theory and Applications of Satisfiability Testing, SAT 2022, Haifa, Israel, August 2-5, 2022 Kuldeep S. Meel, Ofer Strichman |
| 2022 | A Comprehensive Study of k-Portfolios of Recent SAT Solvers. Jakob Bach, Ashlin Iser, Klemens Böhm |
| 2022 | A Generalization of the Satisfiability Coding Lemma and Its Applications. Milan Mossé, Harry Sha, Li-Yang Tan |
| 2022 | A New Exact Solver for (Weighted) Max#SAT. Gilles Audemard, Jean-Marie Lagniez, Marie Miceli |
| 2022 | A SAT Attack on Rota's Basis Conjecture. Markus Kirchweger, Manfred Scheucher, Stefan Szeider |
| 2022 | Analysis of Core-Guided MaxSat Using Cores and Correction Sets. Nina Narodytska, Nikolaj S. Bjørner |
| 2022 | Certified CNF Translations for Pseudo-Boolean Solving. Stephan Gocht, Ruben Martins, Jakob Nordström, Andy Oertel |
| 2022 | Changing Partitions in Rectangle Decision Lists. Stefan Mengel |
| 2022 | Classes of Hard Formulas for QBF Resolution. Agnes Schleitzer, Olaf Beyersdorff |
| 2022 | Front Matter, Table of Contents, Preface, Conference Organization. |
| 2022 | Improvements to the Implicit Hitting Set Approach to Pseudo-Boolean Optimization. Pavel Smirnov, Jeremias Berg, Matti Järvisalo |
| 2022 | Incremental Maximum Satisfiability. Andreas Niskanen, Jeremias Berg, Matti Järvisalo |
| 2022 | Introducing Intel(R) SAT Solver. Alexander Nadel |
| 2022 | MaxSAT-Based Bi-Objective Boolean Optimization. Christoph Jabs, Jeremias Berg, Andreas Niskanen, Matti Järvisalo |
| 2022 | Migrating Solver State. Armin Biere, Md. Solimul Chowdhury, Marijn J. H. Heule, Benjamin Kiesl, Michael W. Whalen |
| 2022 | On the Parallel Parameterized Complexity of MaxSAT Variants. Max Bannach, Malte Skambath, Till Tantau |
| 2022 | On the Performance of Deep Generative Models of Realistic SAT Instances. Iván Garzón, Pablo Mesejo, Jesús Giráldez-Cru |
| 2022 | OptiLog V2: Model, Solve, Tune and Run. Josep Alos, Carlos Ansótegui, Josep M. Salvia, Eduard Torres |
| 2022 | Pedant: A Certifying DQBF Solver. Franz-Xaver Reichl, Friedrich Slivovsky |
| 2022 | Proofs for Propositional Model Counting. Johannes Klaus Fichte, Markus Hecher, Valentin Roland |
| 2022 | QBF Merge Resolution Is Powerful but Unnatural. Meena Mahajan, Gaurav Sood |
| 2022 | QBF Programming with the Modeling Language Bule. Jean Christoph Jung, Valentin Mayer-Eichberger, Abdallah Saffidine |
| 2022 | Quantified CDCL with Universal Resolution. Friedrich Slivovsky |
| 2022 | Quantifier Elimination in Stochastic Boolean Satisfiability. Hao-Ren Wang, Kuan-Hua Tu, Jie-Hong Roland Jiang, Christoph Scholl |
| 2022 | Relating Existing Powerful Proof Systems for QBF. Leroy Chew, Marijn J. H. Heule |
| 2022 | SAT Preprocessors and Symmetry. Markus Anders |
| 2022 | SAT-Based Leximax Optimisation Algorithms. Miguel Cabral, Mikolás Janota, Vasco Manquinho |
| 2022 | Should Decisions in QCDCL Follow Prefix Order? Benjamin Böhm, Tomás Peitl, Olaf Beyersdorff |
| 2022 | The Packing Chromatic Number of the Infinite Square Grid Is at Least 14. Bernardo Subercaseaux, Marijn J. H. Heule |
| 2022 | Tight Bounds for Tseitin Formulas. Dmitry Itsykson, Artur Riazanov, Petr Smirnov |
| 2022 | Towards Learning Quantifier Instantiation in SMT. Mikolás Janota, Jelle Piepenbrock, Bartosz Piotrowski |
| 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 | Weighted Model Counting with Twin-Width. Robert Ganian, Filip Pokrývka, André Schidler, Kirill Simonov, Stefan Szeider |