Accepted Paper List
- Alexey Ignatiev, Zi Li Tan and Christos Karamanos. Towards Universally Accessible SAT Technology
- Markus Anders, Sofia Brenner and Gaurav Rattan. satsuma: Structure-based Symmetry Breaking in SAT
- Armin Biere, Katalin Fazekas, Mathias Fleury and Nils Froleyks. Clausal Congruence Closure
- Lukáš Holík and Pavol Vargovčík. Antichain with SAT and Tries
- Dominik Schreiber. Scalable Trusted SAT Solving with on-the-fly LRAT Checking
- Yogesh Dahiya, Meena Mahajan and Sasank Mouli. New lower bounds for Polynomial Calculus over non-Boolean bases
- Christoph Scholl, Tobias Seufert and Fabian Siegwolf. Hierarchical Stochastic SAT and Quality Assessment of Logic Locking
- Franz-Xaver Reichl, Friedrich Slivovsky and Stefan Szeider. eSLIM: Circuit Minimization with SAT Based Local Improvement
- Jiong Yang, Yaroslav A. Kharkov, Yunong Shi, Marijn Heule and Bruno Dutertre. Quantum Circuit Mapping Based on Incremental and Parallel SAT Solving
- Hadar Shavit and Holger Hoos. Revisiting SATZilla Features in 2024
- Alexis de Colnet. On the Relative Efficiency of Dynamic and Static Top-Down Compilation to Decision-DNNF
- Dror Fried, Alexander Nadel, Roberto Sebastiani and Yogev Shalmon. Entailing Generalization Boosts Enumeration
- Jean Marie Lagniez, Pierre Marquis and Armin Biere. Dynamic Blocked Clause Elimination for Projected Model Counting
- Friedrich Slivovsky. Strategy Extraction by Interpolation
- Jinqiang Yu, Graham Farr, Alexey Ignatiev and Peter J. Stuckey. Anytime Approximate Formal Feature Attribution
- Robert Nieuwenhuis, Albert Oliveras, Enric Rodríguez Carbonell and Rui Zhao. Speeding-up Pseudo-Boolean Propagation
- Leszek Aleksander Kołodziejczyk and Neil Thapen. The strength of the dominance rule
- Tianwei Zhang, Tomáš Peitl and Stefan Szeider. Small unsatisfiable k-CNFs with bounded literal occurrence
- Markus Iser and Christoph Jabs. Global Benchmark Database
- Ilario Bonacina, María Luisa Bonet and Massimo Lauria. MaxSAT Resolution with Inclusion Redundancy
- Yoichiro Iida, Tomohiro Sonobe and Mary Inaba. Parallel Clause Sharing Strategy based on Graph Structure of SAT Problem
- Daniel Faber, Adalat Jabrayilov and Petra Mutzel. SAT Encoding of Partial Ordering Models for Graph Coloring Problems
- Irfansha Shaik and Jaco van de Pol. Optimal Layout Synthesis for Deep Quantum Circuits on NISQ Processors with 100+ Qubits
- Olaf Beyersdorff, Johannes K. Fichte, Markus Hecher, Tim Hoffmann and Kaspar Kasche. The Relative Strength of #SAT Proof Systems
- Robin Coutelier, Mathias Fleury and Laura Kovács. Lazy Reimplication in Chronological Backtracking
- Vojtěch Havlena, Lukáš Holík, Ondrej Lengal and Juraj Síč. Cooking String-Integer Conversions with Noodles
- Yi Chu, Chu-Min Li, Furong Ye and Shaowei Cai. Enhancing MaxSAT Local Search via a Unified Soft Clause Weighting Scheme
- Dmitry Itsykson and Sergei Ovcharov. On Limits of Symbolic Approach to SAT Solving
