| 2021 | MCP: Capturing Big Data by Satisfiability (Tool Description). | Miki Hermann, Gernot Salzer |
| 2021 | Solving Non-uniform Planted and Filtered Random SAT Formulas Greedily. | Tobias Friedrich, Frank Neumann, Ralf Rothenberger, Andrew M. Sutton |
| 2021 | Efficient All-UIP Learned Clause Minimization. | Mathias Fleury, Armin Biere |
| 2021 | ProCount: Weighted Projected Model Counting with Graded Project-Join Trees. | Jeffrey M. Dudek, Vu H. N. Phan, Moshe Y. Vardi |
| 2021 | Weighted Model Counting Without Parameter Variables. | Paulius Dilkas, Vaishak Belle |
| 2021 | Characterizing Tseitin-Formulas with Short Regular Resolution Refutations. | Alexis de Colnet, Stefan Mengel |
| 2021 | Hardness and Optimality in QBF Proof Systems Modulo NP. | Leroy Chew |
| 2021 | Hash-Based Preprocessing and Inprocessing Techniques in SAT Solvers. | Henrik E. C. Cao |
| 2021 | Deep Cooperation of CDCL and Local Search for SAT. | Shaowei Cai, Xindi Zhang |
| 2021 | Lower Bounds for QCDCL via Formula Gauge. | Benjamin Bhm, Olaf Beyersdorff |
| 2021 | Davis and Putnam Meet Henkin: Solving DQBF with Resolution. | Joshua Blinkhorn, Toms Peitl, Friedrich Slivovsky |
| 2021 | QBFFam: A Tool for Generating QBF Families from Proof Complexity. | Olaf Beyersdorff, Luca Pulina, Martina Seidl, Ankit Shukla |
| 2021 | On Dedicated CDCL Strategies for PB Solvers. | Daniel Le Berre, Romain Wallon |
| 2021 | PyDGGA: Distributed GGA for Automatic Configuration. | Carlos Anstegui, Josep Pon, Meinolf Sellmann, Kevin Tierney |
| 2021 | OptiLog: A Framework for SAT-based Systems. | Carlos Anstegui, Jesus Ojeda, Antnio Pacheco, Josep Pon, Josep M. Salvia, Eduard Torres |
| 2020 | Mycielski Graphs and PR Proofs. | Emre Yolcu, Xinyu Wu, Marijn J. H. Heule |
| 2020 | Simplified and Improved Separations Between Regular and General Resolution by Lifting. | Marc Vinyals, Jan Elffers, Jan Johannsen, Jakob Nordstrm |
| 2020 | Community and LBD-Based Clause Sharing Policy for Parallel SAT Solving. | Vincent Vallade, Ludovic Le Frioux, Souheib Baarir, Julien Sopena, Vijay Ganesh, Fabrice Kordon |
| 2020 | A Faster Algorithm for Propositional Model Counting Parameterized by Incidence Treewidth. | Friedrich Slivovsky, Stefan Szeider |
| 2020 | Short Q-Resolution Proofs with Homomorphisms. | Ankit Shukla, Friedrich Slivovsky, Stefan Szeider |
| 2020 | Designing New Phase Selection Heuristics. | Arijit Shaw, Kuldeep S. Meel |
| 2020 | Reducing Bit-Vector Polynomials to SAT Using Grbner Bases. | Thomas Seed, Andy King, Neil Evans |
| 2020 | Multi-linear Strategy Extraction for QBF Expansion Proofs via Local Soundness. | Matthias Schlaipfer, Friedrich Slivovsky, Georg Weissenbacher, Florian Zuleger |
| 2020 | Reproducible Efficient Parallel SAT Solving. | Hidetomo Nabeshima, Katsumi Inoue |
| 2020 | On CDCL-Based Proof Systems with the Ordered Decision Strategy. | Nathan Mull, Shuo Pang, Alexander A. Razborov |