| 2017 | (I Can Get) Satisfaction: Preference-Based Scheduling for Concert-Goers at Multi-venue Music Festivals. Eldan Cohen, Guoyu Huang, J. Christopher Beck |
| 2017 | A Benders Decomposition Approach to Deciding Modular Linear Integer Arithmetic. Bishoksan Kafle, Graeme Gange, Peter Schachte, Harald Søndergaard, Peter J. Stuckey |
| 2017 | A Distributed Version of Syrup. Gilles Audemard, Jean-Marie Lagniez, Nicolas Szczepanski, Sébastien Tabary |
| 2017 | A Little Blocked Literal Goes a Long Way. Benjamin Kiesl, Marijn J. H. Heule, Martina Seidl |
| 2017 | A Lower Bound on CNF Encodings of the At-Most-One Constraint. Petr Kucera, Petr Savický, Vojtech Vorel |
| 2017 | A Propagation Rate Based Splitting Heuristic for Divide-and-Conquer Solvers. Saeed Nejati, Zack Newsham, Joseph Scott, Jia Hui Liang, Catherine H. Gebotys, Pascal Poupart, Vijay Ganesh |
| 2017 | A Resolution-Style Proof System for DQBF. Markus N. Rabe |
| 2017 | An Adaptive Prefix-Assignment Technique for Symmetry Reduction. Tommi A. Junttila, Matti Karppa, Petteri Kaski, Jukka Kohonen |
| 2017 | An Empirical Study of Branching Heuristics Through the Lens of Global Learning Rate. Jia Hui Liang, Hari Govind V. K., Pascal Poupart, Krzysztof Czarnecki, Vijay Ganesh |
| 2017 | Backdoor Treewidth for SAT. Robert Ganian, M. S. Ramanujan, Stefan Szeider |
| 2017 | CNFgen: A Generator of Crafted Benchmarks. Massimo Lauria, Jan Elffers, Jakob Nordström, Marc Vinyals |
| 2017 | Coverage-Based Clause Reduction Heuristics for CDCL Solvers. Hidetomo Nabeshima, Katsumi Inoue |
| 2017 | Dependency Learning for QBF. Tomás Peitl, Friedrich Slivovsky, Stefan Szeider |
| 2017 | From DQBF to QBF by Dependency Elimination. Ralf Wimmer, Andreas Karrenbauer, Ruben Becker, Christoph Scholl, Bernd Becker |
| 2017 | Hard Satisfiable Formulas for Splittings by Linear Combinations. Dmitry Itsykson, Alexander Knop |
| 2017 | Improving MCS Enumeration via Caching. Alessandro Previti, Carlos Mencía, Matti Järvisalo, João Marques-Silva |
| 2017 | Introducing Pareto Minimal Correction Subsets. Miguel Terra-Neves, Inês Lynce, Vasco Manquinho |
| 2017 | MaxPre: An Extended MaxSAT Preprocessor. Tuukka Korhonen, Jeremias Berg, Paul Saikko, Matti Järvisalo |
| 2017 | New Width Parameters for Model Counting. Robert Ganian, Stefan Szeider |
| 2017 | On Simplification of Formulas with Unconstrained Variables and Quantifiers. Martin Jonás, Jan Strejcek |
| 2017 | On Tackling the Limits of Resolution in SAT Solving. Alexey Ignatiev, António Morgado, João Marques-Silva |
| 2017 | On the Community Structure of Bounded Model Checking SAT Problems. Guillaume Baud-Berthier, Jesús Giráldez-Cru, Laurent Simon |
| 2017 | PaInleSS: A Framework for Parallel SAT Solving. Ludovic Le Frioux, Souheib Baarir, Julien Sopena, Fabrice Kordon |
| 2017 | Probabilistic Model Counting with Short XORs. Dimitris Achlioptas, Panos Theodoropoulos |
| 2017 | SAT-Based Local Improvement for Finding Tree Decompositions of Small Width. Johannes Klaus Fichte, Neha Lodha, Stefan Szeider |
| 2017 | SAT-Encodings for Special Treewidth and Pathwidth. Neha Lodha, Sebastian Ordyniak, Stefan Szeider |
| 2017 | Shortening QBF Proofs with Dependency Schemes. Joshua Blinkhorn, Olaf Beyersdorff |
| 2017 | Symmetric Explanation Learning: Effective Dynamic Symmetry Handling for SAT. Jo Devriendt, Bart Bogaerts, Maurice Bruynooghe |
| 2017 | The GRAT Tool Chain - Efficient (UN)SAT Certificate Checking with Formal Correctness Guarantees. Peter Lammich |
| 2017 | Theory Refinement for Program Verification. Antti E. J. Hyvärinen, Sepideh Asadi, Karine Even-Mendoza, Grigory Fedyukovich, Hana Chockler, Natasha Sharygina |
| 2017 | Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28 - September 1, 2017, Proceedings Serge Gaspers, Toby Walsh |