| 2023 | 26th International Conference on Theory and Applications of Satisfiability Testing, SAT 2023, Alghero, Italy, July 4-8, 2023 Meena Mahajan, Friedrich Slivovsky |
| 2023 | A Comparison of SAT Encodings for Acyclicity of Directed Graphs. Neng-Fa Zhou, Ruiwei Wang, Roland H. C. Yap |
| 2023 | A SAT Solver's Opinion on the Erdős-Faber-Lovász Conjecture. Markus Kirchweger, Tomás Peitl, Stefan Szeider |
| 2023 | Algorithms Transcending the SAT-Symmetry Interface. Markus Anders, Pascal Schweitzer, Mate Soos |
| 2023 | AllSAT for Combinational Circuits. Dror Fried, Alexander Nadel, Yogev Shalmon |
| 2023 | An Analysis of Core-Guided Maximum Satisfiability Solvers Using Linear Programming. George Katsirelos |
| 2023 | Bounds on BDD-Based Bucket Elimination. Stefan Mengel |
| 2023 | CadiBack: Extracting Backbones with CaDiCaL. Armin Biere, Nils Froleyks, Wenxi Wang |
| 2023 | Certified Knowledge Compilation with Application to Verified Model Counting. Randal E. Bryant, Wojciech Nawrocki, Jeremy Avigad, Marijn J. H. Heule |
| 2023 | Combining Cubic Dynamical Solvers with Make/Break Heuristics to Solve SAT. Anshujit Sharma, Matthew X. Burns, Michael C. Huang |
| 2023 | Cutting Planes Width and the Complexity of Graph Isomorphism Refutations. Jacobo Torán, Florian Wörz |
| 2023 | Effective Auxiliary Variables via Structured Reencoding. Andrew Haberlandt, Harrison Green, Marijn J. H. Heule |
| 2023 | Even Shorter Proofs Without New Variables. Adrián Rebola-Pardo |
| 2023 | Explaining SAT Solving Using Causal Reasoning. Jiong Yang, Arijit Shaw, Teodora Baluta, Mate Soos, Kuldeep S. Meel |
| 2023 | Faster LRAT Checking Than Solving with CaDiCaL. Florian Pollitt, Mathias Fleury, Armin Biere |
| 2023 | Front Matter, Table of Contents, Preface, Conference Organization. |
| 2023 | IPASIR-UP: User Propagators for CDCL. Katalin Fazekas, Aina Niemetz, Mathias Preiner, Markus Kirchweger, Stefan Szeider, Armin Biere |
| 2023 | LS-DTKMS: A Local Search Algorithm for Diversified Top-k MaxSAT Problem. Junping Zhou, Jiaxin Liang, Minghao Yin, Bo He |
| 2023 | Learning Shorter Redundant Clauses in SDCL Using MaxSAT. Albert Oliveras, Chunxiao Li, Darryl Wu, Jonathan Chung, Vijay Ganesh |
| 2023 | Limits of CDCL Learning via Merge Resolution. Marc Vinyals, Chunxiao Li, Noah Fleming, Antonina Kolokolova, Vijay Ganesh |
| 2023 | On CNF Conversion for Disjoint SAT Enumeration. Gabriele Masina, Giuseppe Spallitta, Roberto Sebastiani |
| 2023 | On the Complexity of k-DQBF. Long-Hin Fung, Tony Tan |
| 2023 | Polynomial Calculus for MaxSAT. Ilario Bonacina, Maria Luisa Bonet, Jordi Levy |
| 2023 | Proof Complexity of Propositional Model Counting. Olaf Beyersdorff, Tim Hoffmann, Luc Nicolas Spachmann |
| 2023 | QCDCL vs QBF Resolution: Further Insights. Benjamin Böhm, Olaf Beyersdorff |
| 2023 | QMusExt: A Minimal (Un)satisfiable Core Extractor for Quantified Boolean Formulas. Andreas Plank, Martina Seidl |
| 2023 | Reducing Acceptance Marks in Emerson-Lei Automata by QBF Solving. Tereza Schwarzová, Jan Strejcek, Juraj Major |
| 2023 | SAT-Based Generation of Planar Graphs. Markus Kirchweger, Manfred Scheucher, Stefan Szeider |
| 2023 | Separating Incremental and Non-Incremental Bottom-Up Compilation. Alexis de Colnet |
| 2023 | Solving Huge Instances with Intel(R) SAT Solver. Alexander Nadel |
| 2023 | UpMax: User Partitioning for MaxSAT. Pedro Orvalho, Vasco Manquinho, Ruben Martins |
| 2023 | Validation of QBF Encodings with Winning Strategies. Irfansha Shaik, Maximilian Heisinger, Martina Seidl, Jaco van de Pol |