| 2019 | A SAT-Based System for Consistent Query Answering. Akhil A. Dixit, Phokion G. Kolaitis |
| 2019 | Assessing Heuristic Machine Learning Explanations with Model Counting. Nina Narodytska, Aditya A. Shrotri, Kuldeep S. Meel, Alexey Ignatiev, João Marques-Silva |
| 2019 | Backing Backtracking. Sibylle Möhle, Armin Biere |
| 2019 | Circular (Yet Sound) Proofs. Albert Atserias, Massimo Lauria |
| 2019 | Clausal Abstraction for DQBF. Leander Tentrup, Markus N. Rabe |
| 2019 | Combining Resolution-Path Dependencies with Dependency Learning. Tomás Peitl, Friedrich Slivovsky, Stefan Szeider |
| 2019 | CrystalBall: Gazing in the Black Box of SAT Solving. Mate Soos, Raghav Kulkarni, Kuldeep S. Meel |
| 2019 | DRAT Proofs, Propagation Redundancy, and Extended Resolution. Sam Buss, Neil Thapen |
| 2019 | DRAT-based Bit-Vector Proofs in CVC4. Alex Ozdemir, Aina Niemetz, Mathias Preiner, Yoni Zohar, Clark W. Barrett |
| 2019 | DRMaxSAT with MaxHS: First Contact. António Morgado, Alexey Ignatiev, Maria Luisa Bonet, João Marques-Silva, Sam Buss |
| 2019 | Guiding High-Performance SAT Solvers with Unsat-Core Predictions. Daniel Selsam, Nikolaj S. Bjørner |
| 2019 | Incremental Inprocessing in SAT Solving. Katalin Fazekas, Armin Biere, Christoph Scholl |
| 2019 | Knowledge Compilation Languages as Proof Systems. Florent Capelli |
| 2019 | Local Search for Fast Matrix Multiplication. Marijn J. H. Heule, Manuel Kauers, Martina Seidl |
| 2019 | On Computing the Union of MUSes. Carlos Mencía, Oliver Kullmann, Alexey Ignatiev, João Marques-Silva |
| 2019 | On Super Strong ETH. Nikhil Vyas, R. Ryan Williams |
| 2019 | Proof Complexity of Fragments of Long-Distance Q-Resolution. Tomás Peitl, Friedrich Slivovsky, Stefan Szeider |
| 2019 | Proof Complexity of QBF Symmetry Recomputation. Joshua Blinkhorn, Olaf Beyersdorff |
| 2019 | QRAT Polynomially Simulates ∀ \text -Exp+Res. Benjamin Kiesl, Martina Seidl |
| 2019 | QRATPre+: Effective QBF Preprocessing via Strong Redundancy Properties. Florian Lonsing, Uwe Egly |
| 2019 | Revisiting Graph Width Measures for CNF-Encodings. Stefan Mengel, Romain Wallon |
| 2019 | Satisfiability Threshold for Power Law Random 2-SAT in Configuration Model. Oleksii Omelchenko, Andrei A. Bulatov |
| 2019 | Short Proofs in QBF Expansion. Olaf Beyersdorff, Leroy Chew, Judith Clymo, Meena Mahajan |
| 2019 | Simplifying CDCL Clause Database Reduction. Sima Jamali, David Mitchell |
| 2019 | Speeding Up Assumption-Based SAT. Randy Hickey, Fahiem Bacchus |
| 2019 | Syntax-Guided Rewrite Rule Enumeration for SMT Solvers. Andres Nötzli, Andrew Reynolds, Haniel Barbosa, Aina Niemetz, Mathias Preiner, Clark W. Barrett, Cesare Tinelli |
| 2019 | The Equivalences of Refutational QRAT. Leroy Chew, Judith Clymo |
| 2019 | Theory and Applications of Satisfiability Testing - SAT 2019 - 22nd International Conference, SAT 2019, Lisbon, Portugal, July 9-12, 2019, Proceedings Mikolás Janota, Inês Lynce |
| 2019 | Verifying Binarized Neural Networks by Angluin-Style Learning. Andy Shih, Adnan Darwiche, Arthur Choi |