Accepted Paper List

The following papers have been confirmed as accepted for SAT 2024. Conditionally accepted papers will be added to this list once they are confirmed as accepted.

  1. Alexey Ignatiev, Zi Li Tan and Christos Karamanos. Towards Universally Accessible SAT Technology
  2. Markus Anders, Sofia Brenner and Gaurav Rattansatsuma: Structure-based Symmetry Breaking in SAT
  3. Dominik SchreiberScalable Trusted SAT Solving with on-the-fly LRAT Checking
  4. Yogesh Dahiya, Meena Mahajan and Sasank MouliNew lower bounds for Polynomial Calculus over non-Boolean bases
  5. Christoph SchollTobias Seufert and Fabian Siegwolf. Hierarchical Stochastic SAT and Quality Assessment of Logic Locking
  6. Franz-Xaver Reichl, Friedrich Slivovsky and Stefan SzeidereSLIM: Circuit Minimization with SAT Based Local Improvement
  7. Jiong YangYaroslav A. KharkovYunong ShiMarijn Heule and Bruno DutertreQuantum Circuit Mapping Based on Incremental and Parallel SAT Solving
  8. Alexis de Colnet. On the Relative Efficiency of Dynamic and Static Top-Down Compilation to Decision-DNNF
  9. Dror Fried, Alexander NadelRoberto Sebastiani and Yogev Shalmon. Entailing Generalization Boosts Enumeration
  10. Jean Marie LagniezPierre Marquis and Armin BiereDynamic Blocked Clause Elimination for Projected Model Counting
  11. Friedrich Slivovsky. Strategy Extraction by Interpolation
  12. Robert NieuwenhuisAlbert OliverasEnric Rodríguez Carbonell and Rui Zhao. Speeding-up Pseudo-Boolean Propagation
  13. Leszek Aleksander Kołodziejczyk and Neil ThapenThe strength of the dominance rule
  14. Tianwei ZhangTomáš Peitl and Stefan SzeiderSmall unsatisfiable k-CNFs with bounded literal occurrence
  15. Markus Iser and Christoph Jabs. Global Benchmark Database
  16. Ilario BonacinaMaría Luisa Bonet and Massimo LauriaMaxSAT Resolution with Inclusion Redundancy
  17. Yoichiro Iida, Tomohiro Sonobe and Mary Inaba. Parallel Clause Sharing Strategy based on Graph Structure of SAT Problem
  18. Daniel Faber, Adalat Jabrayilov and Petra MutzelSAT Encoding of Partial Ordering Models for Graph Coloring Problems
  19. Irfansha Shaik and Jaco van de PolOptimal Layout Synthesis for Deep Quantum Circuits on NISQ Processors with 100+ Qubits
  20. Olaf Beyersdorff, Johannes K. Fichte, Markus Hecher, Tim Hoffmann and Kaspar Kasche. The Relative Strength of #SAT Proof Systems
  21. Robin Coutelier, Mathias Fleury and Laura KovácsLazy Reimplication in Chronological Backtracking
  22. Vojtěch Havlena, Lukáš HolíkOndrej Lengal and Juraj Síč. Cooking String-Integer Conversions with Noodles
  23. Yi Chu, Chu-Min Li, Furong Ye and Shaowei Cai. Enhancing MaxSAT Local Search via a Unified Soft Clause Weighting Scheme
  24. Dmitry Itsykson and Sergei Ovcharov. On Limits of Symbolic Approach to SAT Solving