LIPIcs, Volume 271, SAT 2023

• Meena Mahajan and Friedrich Slivovsky LIPIcs, Volume 271, SAT 2023, Complete Volume 10.4230/LIPIcs.SAT.2023
• Meena Mahajan and Friedrich Slivovsky Front Matter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.SAT.2023.0
• Markus Anders, Pascal Schweitzer, and Mate Soos Algorithms Transcending the SAT-Symmetry Interface 10.4230/LIPIcs.SAT.2023.1
• Olaf Beyersdorff, Tim Hoffmann, and Luc Nicolas Spachmann Proof Complexity of Propositional Model Counting 10.4230/LIPIcs.SAT.2023.2
• Armin Biere, Nils Froleyks, and Wenxi Wang CadiBack: Extracting Backbones with CaDiCaL 10.4230/LIPIcs.SAT.2023.3
• Benjamin Böhm and Olaf Beyersdorff QCDCL vs QBF Resolution: Further Insights 10.4230/LIPIcs.SAT.2023.4
• Ilario Bonacina, Maria Luisa Bonet, and Jordi Levy Polynomial Calculus for MaxSAT 10.4230/LIPIcs.SAT.2023.5
• Randal E. Bryant, Wojciech Nawrocki, Jeremy Avigad, and Marijn J. H. Heule Certified Knowledge Compilation with Application to Verified Model Counting 10.4230/LIPIcs.SAT.2023.6
• Alexis de Colnet Separating Incremental and Non-Incremental Bottom-Up Compilation 10.4230/LIPIcs.SAT.2023.7
• Katalin Fazekas, Aina Niemetz, Mathias Preiner, Markus Kirchweger, Stefan Szeider, and Armin Biere IPASIR-UP: User Propagators for CDCL 10.4230/LIPIcs.SAT.2023.8
• Dror Fried, Alexander Nadel, and Yogev Shalmon AllSAT for Combinational Circuits 10.4230/LIPIcs.SAT.2023.9
• Long-Hin Fung and Tony Tan On the Complexity of k-DQBF 10.4230/LIPIcs.SAT.2023.10
• Andrew Haberlandt, Harrison Green, and Marijn J. H. Heule Effective Auxiliary Variables via Structured Reencoding 10.4230/LIPIcs.SAT.2023.11
• George Katsirelos An Analysis of Core-Guided Maximum Satisfiability Solvers Using Linear Programming 10.4230/LIPIcs.SAT.2023.12
• Markus Kirchweger, Tomáš Peitl, and Stefan Szeider A SAT Solver’s Opinion on the Erdős-Faber-Lovász Conjecture 10.4230/LIPIcs.SAT.2023.13
• Markus Kirchweger, Manfred Scheucher, and Stefan Szeider SAT-Based Generation of Planar Graphs 10.4230/LIPIcs.SAT.2023.14
• Gabriele Masina, Giuseppe Spallitta, and Roberto Sebastiani On CNF Conversion for Disjoint SAT Enumeration 10.4230/LIPIcs.SAT.2023.15
• Stefan Mengel Bounds on BDD-Based Bucket Elimination 10.4230/LIPIcs.SAT.2023.16
• Alexander Nadel Solving Huge Instances with Intel(R) SAT Solver 10.4230/LIPIcs.SAT.2023.17
• Albert Oliveras, Chunxiao Li, Darryl Wu, Jonathan Chung, and Vijay Ganesh Learning Shorter Redundant Clauses in SDCL Using MaxSAT 10.4230/LIPIcs.SAT.2023.18
• Pedro Orvalho, Vasco Manquinho, and Ruben Martins UpMax: User Partitioning for MaxSAT 10.4230/LIPIcs.SAT.2023.19
• Andreas Plank and Martina Seidl QMusExt: A Minimal (Un)satisfiable Core Extractor for Quantified Boolean Formulas 10.4230/LIPIcs.SAT.2023.20
• Florian Pollitt, Mathias Fleury, and Armin Biere Faster LRAT Checking Than Solving with CaDiCaL 10.4230/LIPIcs.SAT.2023.21
• Adrián Rebola-Pardo Even Shorter Proofs Without New Variables 10.4230/LIPIcs.SAT.2023.22
• Tereza Schwarzová, Jan Strejček, and Juraj Major Reducing Acceptance Marks in Emerson-Lei Automata by QBF Solving 10.4230/LIPIcs.SAT.2023.23
• Irfansha Shaik, Maximilian Heisinger, Martina Seidl, and Jaco van de Pol Validation of QBF Encodings with Winning Strategies 10.4230/LIPIcs.SAT.2023.24
• Anshujit Sharma, Matthew Burns, and Michael C. Huang Combining Cubic Dynamical Solvers with Make/Break Heuristics to Solve SAT 10.4230/LIPIcs.SAT.2023.25
• Jacobo Torán and Florian Wörz Cutting Planes Width and the Complexity of Graph Isomorphism Refutations 10.4230/LIPIcs.SAT.2023.26
• Marc Vinyals, Chunxiao Li, Noah Fleming, Antonina Kolokolova, and Vijay Ganesh Limits of CDCL Learning via Merge Resolution 10.4230/LIPIcs.SAT.2023.27
• Jiong Yang, Arijit Shaw, Teodora Baluta, Mate Soos, and Kuldeep S. Meel Explaining SAT Solving Using Causal Reasoning 10.4230/LIPIcs.SAT.2023.28
• Junping Zhou, Jiaxin Liang, Minghao Yin, and Bo He LS-DTKMS: A Local Search Algorithm for Diversified Top-k MaxSAT Problem 10.4230/LIPIcs.SAT.2023.29
• Neng-Fa Zhou, Ruiwei Wang, and Roland H. C. Yap A Comparison of SAT Encodings for Acyclicity of Directed Graphs 10.4230/LIPIcs.SAT.2023.30