LIPIcs, Volume 305, SAT 2024

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