<h2>LIPIcs, Volume 236, SAT 2022</h2>
<ul>
<li>
<span class="authors">Kuldeep S. Meel and Ofer Strichman</span>
<span class="title">LIPIcs, Volume 236, SAT 2022, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SAT.2022">10.4230/LIPIcs.SAT.2022</a>
</li>
<li>
<span class="authors">Kuldeep S. Meel and Ofer Strichman</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SAT.2022.0">10.4230/LIPIcs.SAT.2022.0</a>
</li>
<li>
<span class="authors">Markus Anders</span>
<span class="title">SAT Preprocessors and Symmetry</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SAT.2022.1">10.4230/LIPIcs.SAT.2022.1</a>
</li>
<li>
<span class="authors">Jakob Bach, Markus Iser, and Klemens Böhm</span>
<span class="title">A Comprehensive Study of k-Portfolios of Recent SAT Solvers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SAT.2022.2">10.4230/LIPIcs.SAT.2022.2</a>
</li>
<li>
<span class="authors">Iván Garzón, Pablo Mesejo, and Jesús Giráldez-Cru</span>
<span class="title">On the Performance of Deep Generative Models of Realistic SAT Instances</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SAT.2022.3">10.4230/LIPIcs.SAT.2022.3</a>
</li>
<li>
<span class="authors">Markus Kirchweger, Manfred Scheucher, and Stefan Szeider</span>
<span class="title">A SAT Attack on Rota’s Basis Conjecture</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SAT.2022.4">10.4230/LIPIcs.SAT.2022.4</a>
</li>
<li>
<span class="authors">Agnes Schleitzer and Olaf Beyersdorff</span>
<span class="title">Classes of Hard Formulas for QBF Resolution</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SAT.2022.5">10.4230/LIPIcs.SAT.2022.5</a>
</li>
<li>
<span class="authors">Dmitry Itsykson, Artur Riazanov, and Petr Smirnov</span>
<span class="title">Tight Bounds for Tseitin Formulas</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SAT.2022.6">10.4230/LIPIcs.SAT.2022.6</a>
</li>
<li>
<span class="authors">Mikoláš Janota, Jelle Piepenbrock, and Bartosz Piotrowski</span>
<span class="title">Towards Learning Quantifier Instantiation in SMT</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SAT.2022.7">10.4230/LIPIcs.SAT.2022.7</a>
</li>
<li>
<span class="authors">Alexander Nadel</span>
<span class="title">Introducing Intel(R) SAT Solver</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SAT.2022.8">10.4230/LIPIcs.SAT.2022.8</a>
</li>
<li>
<span class="authors">Milan Mossé, Harry Sha, and Li-Yang Tan</span>
<span class="title">A Generalization of the Satisfiability Coding Lemma and Its Applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SAT.2022.9">10.4230/LIPIcs.SAT.2022.9</a>
</li>
<li>
<span class="authors">Leroy Chew and Marijn J. H. Heule</span>
<span class="title">Relating Existing Powerful Proof Systems for QBF</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SAT.2022.10">10.4230/LIPIcs.SAT.2022.10</a>
</li>
<li>
<span class="authors">Benjamin Böhm, Tomáš Peitl, and Olaf Beyersdorff</span>
<span class="title">Should Decisions in QCDCL Follow Prefix Order?</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SAT.2022.11">10.4230/LIPIcs.SAT.2022.11</a>
</li>
<li>
<span class="authors">Christoph Jabs, Jeremias Berg, Andreas Niskanen, and Matti Järvisalo</span>
<span class="title">MaxSAT-Based Bi-Objective Boolean Optimization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SAT.2022.12">10.4230/LIPIcs.SAT.2022.12</a>
</li>
<li>
<span class="authors">Pavel Smirnov, Jeremias Berg, and Matti Järvisalo</span>
<span class="title">Improvements to the Implicit Hitting Set Approach to Pseudo-Boolean Optimization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SAT.2022.13">10.4230/LIPIcs.SAT.2022.13</a>
</li>
<li>
<span class="authors">Andreas Niskanen, Jeremias Berg, and Matti Järvisalo</span>
<span class="title">Incremental Maximum Satisfiability</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SAT.2022.14">10.4230/LIPIcs.SAT.2022.14</a>
</li>
<li>
<span class="authors">Robert Ganian, Filip Pokrývka, André Schidler, Kirill Simonov, and Stefan Szeider</span>
<span class="title">Weighted Model Counting with Twin-Width</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SAT.2022.15">10.4230/LIPIcs.SAT.2022.15</a>
</li>
<li>
<span class="authors">Stephan Gocht, Ruben Martins, Jakob Nordström, and Andy Oertel</span>
<span class="title">Certified CNF Translations for Pseudo-Boolean Solving</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SAT.2022.16">10.4230/LIPIcs.SAT.2022.16</a>
</li>
<li>
<span class="authors">Stefan Mengel</span>
<span class="title">Changing Partitions in Rectangle Decision Lists</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SAT.2022.17">10.4230/LIPIcs.SAT.2022.17</a>
</li>
<li>
<span class="authors">Lucas Berent, Lukas Burgholzer, and Robert Wille</span>
<span class="title">Towards a SAT Encoding for Quantum Circuits: A Journey From Classical Circuits to Clifford Circuits and Beyond</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SAT.2022.18">10.4230/LIPIcs.SAT.2022.18</a>
</li>
<li>
<span class="authors">Max Bannach, Malte Skambath, and Till Tantau</span>
<span class="title">On the Parallel Parameterized Complexity of MaxSAT Variants</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SAT.2022.19">10.4230/LIPIcs.SAT.2022.19</a>
</li>
<li>
<span class="authors">Franz-Xaver Reichl and Friedrich Slivovsky</span>
<span class="title">Pedant: A Certifying DQBF Solver</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SAT.2022.20">10.4230/LIPIcs.SAT.2022.20</a>
</li>
<li>
<span class="authors">Bernardo Subercaseaux and Marijn J.H. Heule</span>
<span class="title">The Packing Chromatic Number of the Infinite Square Grid Is at Least 14</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SAT.2022.21">10.4230/LIPIcs.SAT.2022.21</a>
</li>
<li>
<span class="authors">Meena Mahajan and Gaurav Sood</span>
<span class="title">QBF Merge Resolution Is Powerful but Unnatural</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SAT.2022.22">10.4230/LIPIcs.SAT.2022.22</a>
</li>
<li>
<span class="authors">Hao-Ren Wang, Kuan-Hua Tu, Jie-Hong Roland Jiang, and Christoph Scholl</span>
<span class="title">Quantifier Elimination in Stochastic Boolean Satisfiability</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SAT.2022.23">10.4230/LIPIcs.SAT.2022.23</a>
</li>
<li>
<span class="authors">Friedrich Slivovsky</span>
<span class="title">Quantified CDCL with Universal Resolution</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SAT.2022.24">10.4230/LIPIcs.SAT.2022.24</a>
</li>
<li>
<span class="authors">Josep Alòs, Carlos Ansótegui, Josep M. Salvia, and Eduard Torres</span>
<span class="title">OptiLog V2: Model, Solve, Tune and Run</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SAT.2022.25">10.4230/LIPIcs.SAT.2022.25</a>
</li>
<li>
<span class="authors">Nina Narodytska and Nikolaj Bjørner</span>
<span class="title">Analysis of Core-Guided MaxSat Using Cores and Correction Sets</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SAT.2022.26">10.4230/LIPIcs.SAT.2022.26</a>
</li>
<li>
<span class="authors">Armin Biere, Md Solimul Chowdhury, Marijn J. H. Heule, Benjamin Kiesl, and Michael W. Whalen</span>
<span class="title">Migrating Solver State</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SAT.2022.27">10.4230/LIPIcs.SAT.2022.27</a>
</li>
<li>
<span class="authors">Gilles Audemard, Jean-Marie Lagniez, and Marie Miceli</span>
<span class="title">A New Exact Solver for (Weighted) Max#SAT</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SAT.2022.28">10.4230/LIPIcs.SAT.2022.28</a>
</li>
<li>
<span class="authors">Miguel Cabral, Mikoláš Janota, and Vasco Manquinho</span>
<span class="title">SAT-Based Leximax Optimisation Algorithms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SAT.2022.29">10.4230/LIPIcs.SAT.2022.29</a>
</li>
<li>
<span class="authors">Johannes K. Fichte, Markus Hecher, and Valentin Roland</span>
<span class="title">Proofs for Propositional Model Counting</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SAT.2022.30">10.4230/LIPIcs.SAT.2022.30</a>
</li>
<li>
<span class="authors">Jean Christoph Jung, Valentin Mayer-Eichberger, and Abdallah Saffidine</span>
<span class="title">QBF Programming with the Modeling Language Bule</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SAT.2022.31">10.4230/LIPIcs.SAT.2022.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