| 2024 | On the Relative Efficiency of Dynamic and Static Top-Down Compilation to Decision-DNNF. | Alexis de Colnet |
| 2024 | Enhancing MaxSAT Local Search via a Unified Soft Clause Weighting Scheme. | Yi Chu, Chu-Min Li, Furong Ye, Shaowei Cai |
| 2024 | MaxSAT Resolution with Inclusion Redundancy. | Ilario Bonacina, Maria Luisa Bonet, Massimo Lauria |
| 2024 | Clausal Congruence Closure. | Armin Biere, Katalin Fazekas, Mathias Fleury, Nils Froleyks |
| 2024 | The Relative Strength of #SAT Proof Systems. | Olaf Beyersdorff, Johannes Klaus Fichte, Markus Hecher, Tim Hoffmann, Kaspar Kasche |
| 2024 | Satsuma: Structure-Based Symmetry Breaking in SAT. | Markus Anders, Sofia Brenner, Gaurav Rattan |
| 2024 | Quantum Circuit Mapping Based on Incremental and Parallel SAT Solving. | Jiong Yang, Yaroslav A. Kharkov, Yunong Shi, Marijn J. H. Heule, Bruno Dutertre |
| 2024 | Hierarchical Stochastic SAT and Quality Assessment of Logic Locking. | Christoph Scholl, Tobias Seufert, Fabian Siegwolf |
| 2024 | Trusted Scalable SAT Solving with On-The-Fly LRAT Checking. | Dominik Schreiber |
| 2023 | A Comparison of SAT Encodings for Acyclicity of Directed Graphs. | Neng-Fa Zhou, Ruiwei Wang, Roland H. C. Yap |
| 2023 | LS-DTKMS: A Local Search Algorithm for Diversified Top-k MaxSAT Problem. | Junping Zhou, Jiaxin Liang, Minghao Yin, Bo He |
| 2023 | Front Matter, Table of Contents, Preface, Conference Organization. | |
| 2023 | Limits of CDCL Learning via Merge Resolution. | Marc Vinyals, Chunxiao Li, Noah Fleming, Antonina Kolokolova, Vijay Ganesh |
| 2023 | Enhancing State-of-the-Art Parallel SAT Solvers Through Optimized Sharing Policies. | Vincent Vallade, Julien Sopena, Souheib Baarir |
| 2023 | Cutting Planes Width and the Complexity of Graph Isomorphism Refutations. | Jacobo Torn, Florian Wrz |
| 2023 | Combining Cubic Dynamical Solvers with Make/Break Heuristics to Solve SAT. | Anshujit Sharma, Matthew X. Burns, Michael C. Huang |
| 2023 | Validation of QBF Encodings with Winning Strategies. | Irfansha Shaik, Maximilian Heisinger, Martina Seidl, Jaco van de Pol |
| 2023 | Reducing Acceptance Marks in Emerson-Lei Automata by QBF Solving. | Tereza Schwarzov, Jan Strejcek, Juraj Major |
| 2023 | Even Shorter Proofs Without New Variables. | Adrin Rebola-Pardo |
| 2023 | Faster LRAT Checking Than Solving with CaDiCaL. | Florian Pollitt, Mathias Fleury, Armin Biere |
| 2023 | QMusExt: A Minimal (Un)satisfiable Core Extractor for Quantified Boolean Formulas. | Andreas Plank, Martina Seidl |
| 2023 | Uncovering and Classifying Bugs in MaxSAT Solvers through Fuzzing and Delta Debugging. | Tobias Paxian, Armin Biere |
| 2023 | UpMax: User Partitioning for MaxSAT. | Pedro Orvalho, Vasco Manquinho, Ruben Martins |
| 2023 | Learning Shorter Redundant Clauses in SDCL Using MaxSAT. | Albert Oliveras, Chunxiao Li, Darryl Wu, Jonathan Chung, Vijay Ganesh |
| 2023 | Solving Huge Instances with Intel(R) SAT Solver. | Alexander Nadel |