Abstract is missing.
- On the Parallel Parameterized Complexity of MaxSAT VariantsMax Bannach, Malte Skambath, Till Tantau. [doi]
- Certified CNF Translations for Pseudo-Boolean SolvingStephan Gocht, Ruben Martins, Jakob Nordström, Andy Oertel. [doi]
- Tight Bounds for Tseitin FormulasDmitry Itsykson, Artur Riazanov, Petr Smirnov. [doi]
- Towards Learning Quantifier Instantiation in SMTMikolás Janota, Jelle Piepenbrock, Bartosz Piotrowski. [doi]
- Pedant: A Certifying DQBF SolverFranz-Xaver Reichl, Friedrich Slivovsky. [doi]
- Introducing Intel(R) SAT SolverAlexander Nadel. [doi]
- Front Matter, Table of Contents, Preface, Conference Organization [doi]
- Changing Partitions in Rectangle Decision ListsStefan Mengel. [doi]
- Should Decisions in QCDCL Follow Prefix Order?Benjamin Böhm 0001, Tomás Peitl, Olaf Beyersdorff. [doi]
- Improvements to the Implicit Hitting Set Approach to Pseudo-Boolean OptimizationPavel Smirnov 0003, Jeremias Berg, Matti Järvisalo. [doi]
- The Packing Chromatic Number of the Infinite Square Grid Is at Least 14Bernardo Subercaseaux, Marijn J. H. Heule. [doi]
- On the Performance of Deep Generative Models of Realistic SAT InstancesIván Garzón, Pablo Mesejo, Jesús Giráldez-Cru. [doi]
- Proofs for Propositional Model CountingJohannes Klaus Fichte, Markus Hecher, Valentin Roland. [doi]
- A Comprehensive Study of k-Portfolios of Recent SAT SolversJakob Bach, Markus Iser, Klemens Böhm. [doi]
- QBF Programming with the Modeling Language BuleJean Christoph Jung, Valentin Mayer-Eichberger, Abdallah Saffidine. [doi]
- Relating Existing Powerful Proof Systems for QBFLeroy Chew, Marijn J. H. Heule. [doi]
- A New Exact Solver for (Weighted) Max#SATGilles Audemard, Jean-Marie Lagniez, Marie Miceli. [doi]
- Classes of Hard Formulas for QBF ResolutionAgnes Schleitzer, Olaf Beyersdorff. [doi]
- SAT Preprocessors and SymmetryMarkus Anders. [doi]
- Analysis of Core-Guided MaxSat Using Cores and Correction SetsNina Narodytska, Nikolaj S. Bjørner. [doi]
- Quantifier Elimination in Stochastic Boolean SatisfiabilityHao-Ren Wang, Kuan-Hua Tu, Jie-Hong Roland Jiang, Christoph Scholl. [doi]
- Quantified CDCL with Universal ResolutionFriedrich Slivovsky. [doi]
- A Generalization of the Satisfiability Coding Lemma and Its ApplicationsMilan Mossé, Harry Sha, Li-Yang Tan. [doi]
- Migrating Solver StateArmin Biere, Md. Solimul Chowdhury, Marijn J. H. Heule, Benjamin Kiesl, Michael W. Whalen. [doi]
- Weighted Model Counting with Twin-WidthRobert Ganian, Filip Pokrývka, André Schidler, Kirill Simonov, Stefan Szeider. [doi]
- SAT-Based Leximax Optimisation AlgorithmsMiguel Cabral, Mikolás Janota, Vasco M. Manquinho. [doi]
- A SAT Attack on Rota's Basis ConjectureMarkus Kirchweger, Manfred Scheucher, Stefan Szeider. [doi]
- QBF Merge Resolution Is Powerful but UnnaturalMeena Mahajan, Gaurav Sood 0001. [doi]
- Incremental Maximum SatisfiabilityAndreas Niskanen, Jeremias Berg, Matti Järvisalo. [doi]
- MaxSAT-Based Bi-Objective Boolean OptimizationChristoph Jabs, Jeremias Berg, Andreas Niskanen, Matti Järvisalo. [doi]
- OptiLog V2: Model, Solve, Tune and RunJosep Alos, Carlos Ansótegui, Josep M. Salvia, Eduard Torres. [doi]
- Towards a SAT Encoding for Quantum Circuits: A Journey From Classical Circuits to Clifford Circuits and BeyondLucas Berent, Lukas Burgholzer, Robert Wille. [doi]