| 2018 | ALIAS: A Modular Tool for Finding Backdoors for SAT. Stepan Kochemazov, Oleg Zaikin |
| 2018 | Approximately Propagation Complete and Conflict Propagating Constraint Encodings. Rüdiger Ehlers, Francisco Palau Romero |
| 2018 | Centrality-Based Improvements to CDCL Heuristics. Sima Jamali, David Mitchell |
| 2018 | Chronological Backtracking. Alexander Nadel, Vadim Ryvchin |
| 2018 | Circuit-Based Search Space Pruning in QBF. Mikolás Janota |
| 2018 | Constrained Image Generation Using Binarized Neural Networks with Decision Procedures. Svyatoslav Korneev, Nina Narodytska, Luca Pulina, Armando Tacchella, Nikolaj S. Bjørner, Mooly Sagiv |
| 2018 | Cops-Robber Games and the Resolution of Tseitin Formulas. Nicola Galesi, Navid Talebanfard, Jacobo Torán |
| 2018 | Dependency Quantified Boolean Formulas: An Overview of Solution Methods and Applications - Extended Abstract. Christoph Scholl, Ralf Wimmer |
| 2018 | Dynamic Polynomial Watchdog Encoding for Solving Weighted MaxSAT. Tobias Paxian, Sven Reimer, Bernd Becker |
| 2018 | Effective Use of SMT Solvers for Program Equivalence Checking Through Invariant-Sketching and Query-Decomposition. Shubhani Gupta, Aseem Saxena, Anmol Mahajan, Sorav Bansal |
| 2018 | Experimenting on Solving Nonlinear Integer Arithmetic with Incremental Linearization. Alessandro Cimatti, Alberto Griggio, Ahmed Irfan, Marco Roveri, Roberto Sebastiani |
| 2018 | Exploiting Treewidth for Projected Model Counting and Its Limits. Johannes Klaus Fichte, Markus Hecher, Michael Morak, Stefan Woltran |
| 2018 | Fast Sampling of Perfectly Uniform Satisfying Assignments. Dimitris Achlioptas, Zayd S. Hammoudeh, Panos Theodoropoulos |
| 2018 | Fast and Flexible Probabilistic Model Counting. Dimitris Achlioptas, Zayd Hammoudeh, Panos Theodoropoulos |
| 2018 | Finding All Minimal Safe Inductive Sets. Ryan Berryhill, Alexander Ivrii, Andreas G. Veneris |
| 2018 | In Between Resolution and Cutting Planes: A Study of Proof Systems for Pseudo-Boolean SAT Solving. Marc Vinyals, Jan Elffers, Jesús Giráldez-Cru, Stephan Gocht, Jakob Nordström |
| 2018 | Local Soundness for QBF Calculi. Martin Suda, Bernhard Gleiss |
| 2018 | Machine Learning-Based Restart Policy for CDCL SAT Solvers. Jia Hui Liang, Chanseok Oh, Minu Mathew, Ciza Thomas, Chunxiao Li, Vijay Ganesh |
| 2018 | Minimal Unsatisfiability and Minimal Strongly Connected Digraphs. Hoda Abbasizanjani, Oliver Kullmann |
| 2018 | Polynomial-Time Validation of QCDCL Certificates. Tomás Peitl, Friedrich Slivovsky, Stefan Szeider |
| 2018 | PySAT: A Python Toolkit for Prototyping with SAT Oracles. Alexey Ignatiev, António Morgado, João Marques-Silva |
| 2018 | QBF as an Alternative to Courcelle's Theorem. Michael Lampis, Stefan Mengel, Valia Mitsou |
| 2018 | Sharpness of the Satisfiability Threshold for Non-uniform Random k-SAT. Tobias Friedrich, Ralf Rothenberger |
| 2018 | Solving MaxSAT with Bit-Vector Optimization. Alexander Nadel |
| 2018 | Symmetries of Quantified Boolean Formulas. Manuel Kauers, Martina Seidl |
| 2018 | Theory and Applications of Satisfiability Testing - SAT 2018 - 21st International Conference, SAT 2018, Held as Part of the Federated Logic Conference, FloC 2018, Oxford, UK, July 9-12, 2018, Proceedings Olaf Beyersdorff, Christoph M. Wintersteiger |
| 2018 | Using Combinatorial Benchmarks to Probe the Reasoning Power of Pseudo-Boolean Solvers. Jan Elffers, Jesús Giráldez-Cru, Jakob Nordström, Marc Vinyals |
| 2018 | XOR-Satisfiability Set Membership Filters. Sean A. Weaver, Hannah J. Roberts, Michael J. Smith |