| 2020 | Four Flavors of Entailment. | Sibylle Mhle, Roberto Sebastiani, Armin Biere |
| 2020 | Reasoning About Strong Inconsistency in ASP. | Carlos Menca, Joo Marques-Silva |
| 2020 | Positional Games and QBF: The Corrective Encoding. | Valentin Mayer-Eichberger, Abdallah Saffidine |
| 2020 | On the Effect of Learned Clauses on Stochastic Local Search. | Jan-Hendrik Lorenz, Florian Wrz |
| 2020 | Towards a Complexity-Theoretic Understanding of Restarts in SAT Solvers. | Chunxiao Li, Noah Fleming, Marc Vinyals, Toniann Pitassi, Vijay Ganesh |
| 2020 | Towards a Better Understanding of (Partial Weighted) MaxSAT Proof Systems. | Javier Larrosa, Emma Rollon |
| 2020 | Improving Implementation of SAT Competitions 2017-2019 Winners. | Stepan Kochemazov |
| 2020 | Incremental Encoding of Pseudo-Boolean Goal Functions Based on Comparator Networks. | Michal Karpinski, Marek Piotrw |
| 2020 | Speeding up Quantified Bit-Vector SMT Solvers by Bit-Width Reductions and Extensions. | Martin Jons, Jan Strejcek |
| 2020 | SAT-Based Encodings for Optimal Decision Trees with Explicit Paths. | Mikols Janota, Antnio Morgado |
| 2020 | Trail Saving on Backtrack. | Randy Hickey, Fahiem Bacchus |
| 2020 | Distributed Cube and Conquer with Paracooba. | Maximilian Heisinger, Mathias Fleury, Armin Biere |
| 2020 | Taming High Treewidth with Abstraction, Nested Dynamic Programming, and Database Technology. | Markus Hecher, Patrick Thier, Stefan Woltran |
| 2020 | MaxSAT Resolution and Subcube Sums. | Yuval Filmus, Meena Mahajan, Gaurav Sood, Marc Vinyals |
| 2020 | Clause Size Reduction with all-UIP Learning. | Nick Feng, Fahiem Bacchus |
| 2020 | SAT Solving with Fragmented Hamiltonian Path Constraints for Wire Arc Additive Manufacturing. | Rdiger Ehlers, Kai Treutler, Volker Wesling |
| 2020 | A Lower Bound on DNNF Encodings of Pseudo-Boolean Constraints. | Alexis de Colnet |
| 2020 | Sorting Parity Encodings by Reusing Variables. | Leroy Chew, Marijn J. H. Heule |
| 2020 | Equivalence Between Systems Stronger Than Resolution. | Maria Luisa Bonet, Jordi Levy |
| 2020 | Strong (D)QBF Dependency Schemes via Tautology-Free Resolution Paths. | Olaf Beyersdorff, Joshua Blinkhorn, Toms Peitl |
| 2020 | On Weakening Strategies for PB Solvers. | Daniel Le Berre, Pierre Marquis, Romain Wallon |
| 2020 | Abstract Cores in Implicit Hitting Set MaxSat Solving. | Jeremias Berg, Fahiem Bacchus, Alex Poole |
| 2020 | SAT Heritage: A Community-Driven Effort for Archiving, Building and Running More Than Thousand SAT Solvers. | Gilles Audemard, Loc Paulev, Laurent Simon |
| 2020 | Matrix Multiplication: Verifying Strong Uniquely Solvable Puzzles. | Matthew Anderson, Zongliang Ji, Anthony Yang Xu |
| 2020 | On the Sparsity of XORs in Approximate Model Counting. | Durgesh Agrawal, Bhavishya, Kuldeep S. Meel |