| 2024 | 27th International Conference on Theory and Applications of Satisfiability Testing, SAT 2024, Pune, India, August 21-24, 2024 Supratik Chakraborty, Jie-Hong Roland Jiang |
| 2024 | Antichain with SAT and Tries. Lukás Holík, Pavol Vargovcík |
| 2024 | Anytime Approximate Formal Feature Attribution. Jinqiang Yu, Graham Farr, Alexey Ignatiev, Peter J. Stuckey |
| 2024 | Clausal Congruence Closure. Armin Biere, Katalin Fazekas, Mathias Fleury, Nils Froleyks |
| 2024 | Cooking String-Integer Conversions with Noodles. Vojtech Havlena, Lukás Holík, Ondrej Lengál, Juraj Síc |
| 2024 | Dynamic Blocked Clause Elimination for Projected Model Counting. Jean-Marie Lagniez, Pierre Marquis, Armin Biere |
| 2024 | Enhancing MaxSAT Local Search via a Unified Soft Clause Weighting Scheme. Yi Chu, Chu-Min Li, Furong Ye, Shaowei Cai |
| 2024 | Entailing Generalization Boosts Enumeration. Dror Fried, Alexander Nadel, Roberto Sebastiani, Yogev Shalmon |
| 2024 | Front Matter, Table of Contents, Preface, Conference Organization. |
| 2024 | Global Benchmark Database. Ashlin Iser, Christoph Jabs |
| 2024 | Hierarchical Stochastic SAT and Quality Assessment of Logic Locking. Christoph Scholl, Tobias Seufert, Fabian Siegwolf |
| 2024 | Lazy Reimplication in Chronological Backtracking. Robin Coutelier, Mathias Fleury, Laura Kovács |
| 2024 | Logical Algorithmics: From Relational Queries to Boolean Reasoning (Invited Talk). Moshe Y. Vardi |
| 2024 | MaxSAT Resolution with Inclusion Redundancy. Ilario Bonacina, Maria Luisa Bonet, Massimo Lauria |
| 2024 | Models and Counter-Models of Quantified Boolean Formulas (Invited Talk). Martina Seidl |
| 2024 | New Lower Bounds for Polynomial Calculus over Non-Boolean Bases. Yogesh Dahiya, Meena Mahajan, Sasank Mouli |
| 2024 | On Limits of Symbolic Approach to SAT Solving. Dmitry Itsykson, Sergei Ovcharov |
| 2024 | On the Relative Efficiency of Dynamic and Static Top-Down Compilation to Decision-DNNF. Alexis de Colnet |
| 2024 | Optimal Layout Synthesis for Deep Quantum Circuits on NISQ Processors with 100+ Qubits. Irfansha Shaik, Jaco van de Pol |
| 2024 | Parallel Clause Sharing Strategy Based on Graph Structure of SAT Problem. Yoichiro Iida, Tomohiro Sonobe, Mary Inaba |
| 2024 | Quantum Circuit Mapping Based on Incremental and Parallel SAT Solving. Jiong Yang, Yaroslav A. Kharkov, Yunong Shi, Marijn J. H. Heule, Bruno Dutertre |
| 2024 | Revisiting SATZilla Features in 2024. Hadar Shavit, Holger H. Hoos |
| 2024 | SAT Encoding of Partial Ordering Models for Graph Coloring Problems. Daniel Faber, Adalat Jabrayilov, Petra Mutzel |
| 2024 | Satsuma: Structure-Based Symmetry Breaking in SAT. Markus Anders, Sofia Brenner, Gaurav Rattan |
| 2024 | Scalable Proof Production and Checking in SMT (Invited Talk). Cesare Tinelli |
| 2024 | Small Unsatisfiable k-CNFs with Bounded Literal Occurrence. Tianwei Zhang, Tomás Peitl, Stefan Szeider |
| 2024 | Speeding up Pseudo-Boolean Propagation. Robert Nieuwenhuis, Albert Oliveras, Enric Rodríguez-Carbonell, Rui Zhao |
| 2024 | Strategy Extraction by Interpolation. Friedrich Slivovsky |
| 2024 | The Relative Strength of #SAT Proof Systems. Olaf Beyersdorff, Johannes Klaus Fichte, Markus Hecher, Tim Hoffmann, Kaspar Kasche |
| 2024 | The Strength of the Dominance Rule. Leszek Aleksander Kolodziejczyk, Neil Thapen |
| 2024 | Towards Universally Accessible SAT Technology. Alexey Ignatiev, Zi Li Tan, Christos Karamanos |
| 2024 | Trusted Scalable SAT Solving with On-The-Fly LRAT Checking. Dominik Schreiber |
| 2024 | eSLIM: Circuit Minimization with SAT Based Local Improvement. Franz-Xaver Reichl, Friedrich Slivovsky, Stefan Szeider |