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