• Beyond Core-Guided MaxSAT (long), Ilario Bonacina, Jordi Levy, Ion Mikel Liberal
  • decdnnf_rs: A framework for Querying d-DNNF (tool), Jean-Marie Lagniez, Emmanuel Lonca
  • CaDiCaL 3.0 (tool), Florian Pollitt, Mathias Fleury, Katalin Fazekas, Nils Froleyks, André Schidler, Dominik Schreiber, Armin Biere
  • Factoring Learned Clauses (long), Florian Pollitt, Zachary Battleman, Mathias Fleury, Yakir Vizel, Marijn Heule, Armin Biere, Randal E. Bryant
  • Backtrackable Inprocessing (long), Alexander Nadel
  • Definition-based dependency schemes (long), David Kattermann, Martina Seidl, Clemens Hofstadler
  • Strong (D)QBF Dependency Schemes via Pure Paths with Applications to Proof Checking (long), Leroy Chew, Tomáš Peitl
  • PASSAT: Deep Cooperation of Unit Propagation and Local Search in Incomplete SAT Solving (long), Mingming Jin, Zhijie Kuang, Jiongzhi Zheng, Kun Mao, Kun He
  • Scuttle: A System for Multi-Objective MaxSAT (tool), Christoph Jabs, Jeremias Berg, Matti Järvisalo
  • WhyUnsat: a practical explanation tool (tool), Robert Nieuwenhuis, Albert Oliveras, Enric Rodríguez Carbonell
  • Bilateral Treewidth for QBF: Where Strategies and Resolution Meet (long), Robert Ganian, Marlene Gründel
  • An Exponential Separation between Deterministic CDCL and DPLL Solvers (long), Sahil Samar, Marc Vinyals, Vijay Ganesh
  • Proof Systems for QBF Synthesis: Extracting Skolem and Herbrand Functions (long), S. Akshay, Olaf Beyersdorff, Supratik Chakraborty, Lea Kasche, Meena Mahajan, Luc Nicolas Spachmann
  • Conditional Autarkies: Hard Formulas Made Easy (long), Ilario Bonacina, Maria Luisa Bonet, Antonina Kolokolova, Massimo Lauria
  • Unified Programmatic Access to CO Benchmarks, to Connect Constraint Solving Communities (tool), Thomas Sergeys, Tias Guns, Ignace Bleukx
  • On Knowledge Compilation For Two-Variable First-Order Logic (long), Qiaolan Meng, Juhua Pu, Hongting Niu, Yuyi Wang, Yuanhong Wang, Ondřej Kuželka
  • On Proof Systems for #QBF (short), Sravanthi Chede, Leroy Chew, Vaibhav Krishan, Anil Shukla
  • Long-Distance Q(D^{std})Consensus is sound (short), Abhimanyu Choudhury, Meena Mahajan, Friedrich Slivovsky
  • Sustainable Benchmarking Tool (tool), Ashlin Iser, Marie Anastacio, Théo Matricon, Laurent Simon, Holger H. Hoos
  • Generalizing CDCL with Graph Backtracking (long), Robin Coutelier, Thomas Hader, Laura Kovács
  • Proof Systems Based on Structured Circuits (long), Matthäus Micun, Christoph Berkholz
  • CAQE: Strong as Solver, Weak as Proof System (long), Benjamin Böhm, Olaf Beyersdorff
  • Near-Optimal Encodings of Cardinality Constraints (long), Andrew Krapivin, Benjamin Przybocki, Bernardo Subercaseaux
  • The Compilability Thresholds of 2-CNF to OBDD (long), Alexis de Colnet, Alfons Laarman, Joon Hyung Lee
  • Automated Reencoding Meets Graph Theory (long), Benjamin Przybocki, Bernardo Subercaseaux, Marijn Heule
  • HitPBO: An Implicit Hitting Set Solver for Pseudo-Boolean Optimization (tool), Hannes Ihalainen, Dieter Vandesande, Andre Schidler, Jeremias Berg, Matti Järvisalo
  • Hermax: A Unified MaxSAT library (tool), Josep Maria Salvia Hornos, Cèsar Fernández Camón, Carles Mateu Piñol
  • A canonical generalization of OBDD (long), Florent Capelli, YooJung Choi, Stefan Mengel, Martin Munoz, Guy Van den Broeck
  • A Natively Parallel Proof Framework for Clause-Sharing SAT Solving (long), Ruben Götz, Michael Dörr, Dominik Schreiber
  • d-QBF with Few Existential Variables Revisited (long), Andreas Grigorjew, Michael Lampis
  • Exact Symbolic Reasoning for Nonlinear Stochastic SMT via Cylindrical Algebraic Decomposition (long), Jung-Cheng Lin, Chia-Hsuan Su, Jie-Hong R. Jiang, Hiroshi Unno
  • d-DNNF Modulo Theories: A General Framework for Polytime SMT Queries (long), Gabriele Masina, Emanuele Civini, Massimo Michelutti, Giuseppe Spallitta, Roberto Sebastiani
  • Simplify, Order, Break, Repeat (long), Markus Anders, Cayden Codel, Marijn J. H. Heule
  • NLIPSat: Satisfiability-based Nonlinear Integer Programing Encoding Toolkit (tool), Zhengling Yangli, Zhifei Zheng, Sami Cherif, Rui Sá Shibasaki, Chu-Min Li
  • Shapley-Shubik Attribution from Minimal Subsets (short), Pablo Martínez-Naredo, Raúl Mencía, Joao Marques-Silva, Carlos Mencía
  • SMT with Uninterpreted Functions and Monotonicity Constraints in Systems Biology (long), Ondřej Huvar, Martin Jonáš, Samuel Pastva
  • SAT Modulo Well-Founded Semantics (long), Thomas Eiter, Tobias Nießen, Davide Soldà
  • Dsat: A Native SAT Solver for Discrete Logic (long), Yaofang Zhang, Ken Zhou, Adnan Darwiche
  • Extending CDCL to disjunctions of parity equations (long), Paul Beame, Glenn Sun
  • New Algorithms for Parity-SAT and Its Bounded-Occurrence Versions (long), Sanjay Jain, Junqiang Peng, Frank Stephan, Haoyun Tang, Mingyu Xiao
  • Efficient Identification of Isomorphic SAT Instances (tool), Frederick Gehm, Ashlin Iser