- Markus Anders, Pascal Schweitzer and Mate Soos. Algorithms Transcending the SAT-Symmetry Interface
- Olaf Beyersdorff, Tim Hoffmann and Luc Nicolas Spachmann. Proof Complexity of Propositional Model Counting
- Armin Biere, Nils Froleyks and Wenxi Wang. CadiBack: Extracting Backbones with CaDiCaL
- Benjamin Böhm and Olaf Beyersdorff. QCDCL vs QBF Resolution: Further Insights
- Ilario Bonacina, María-Luisa Bonet and Jordi Levy. Polynomial Calculus for MaxSAT
- Randal Bryant, Wojciech Nawrocki, Jeremy Avigad and Marijn Heule. Certified Knowledge Compilation with Application to Verified Model Counting
- Alexis de Colnet. Separating Incremental and Non-Incremental Bottom-Up Compilation
- Katalin Fazekas, Aina Niemetz, Mathias Preiner, Markus Kirchweger, Stefan Szeider and Armin Biere. IPASIR-UP: User Propagators for CDCL
- Long-Hin Fung and Tony Tan. On the complexity of k-DQBF
- Andrew Haberlandt, Harrison Green and Marijn Heule. Effective Auxiliary Variables via Structured Reencoding
- George Katsirelos. An Analysis of Core-guided Maximum Satisfiability Solvers Using Linear Programming
- Markus Kirchweger, Tomáš Peitl and Stefan Szeider. A SAT Solver’s Opinion on the Erdős-Faber-Lovász Conjecture
- Markus Kirchweger, Manfred Scheucher and Stefan Szeider. SAT-Based Generation of Planar Graphs
- Gabriele Masina, Giuseppe Spallitta and Roberto Sebastiani. On CNF Conversion for Disjoint SAT Enumeration
- Stefan Mengel. Bounds on BDD-Based Bucket Elimination
- Alexander Nadel. Solving Huge Instances with Intel(R) SAT Solver
- Albert Oliveras, Chunxiao Li, Darryl Wu, Jonathan Chung and Vijay Ganesh. Learning Shorter Redundant Clauses in SDCL Using MaxSAT
- Pedro Orvalho, Vasco Manquinho and Ruben Martins. UpMax : User partitioning for MaxSAT
- Andreas Plank and Martina Seidl. QMusExt: A Minimal (Un)satisfiable Core Extractor for Quantified Boolean Formulas
- Florian Pollitt, Mathias Fleury and Armin Biere. Faster LRAT Checking than Solving with CaDiCaL
- Adrian Rebola-Pardo. Even shorter proofs without new variables
- Tereza Schwarzová, Jan Strejček and Juraj Major. Reducing Acceptance Marks in Emerson-Lei Automata by QBF Solving
- Irfansha Shaik, Maximilian Heisinger, Martina Seidl and Jaco van de Pol. Validation of QBF Encodings with Winning Strategies
- Yogev Shalmon, Alexander Nadel and Dror Fried. AllSAT for Combinational Circuits
- Anshujit Sharma, Matthew Burns and Michael Huang. Combining Cubic Dynamical Solvers with Make/Break Heuristics to Solve SAT
- Jacobo Torán and Florian Wörz. Cutting Planes Width and the Complexity of Graph Isomorphism Refutations
- Marc Vinyals, Chunxiao Li, Noah Fleming, Antonina Kolokolova and Vijay Ganesh. Limits of CDCL Learning via Merge Resolution
- Jiong Yang, Arijit Shaw, Teodora Baluta and Kuldeep S. Meel. Explaining SAT Solving Using Causal Reasoning
- Junping Zhou, Jiaxin Liang, Minghao Yin and Bo He. LS-DTKMS: A Local Search Algorithm for Diversified Top-k MaxSAT Problem
- Neng-Fa Zhou, Ruiwei Wang and Roland Yap. A Comparison of SAT Encodings for Acyclicity of Directed Graphs