- Marc Vinyals, Chunxiao Li, Noah Fleming, Antonina Kolokolova, Vijay Ganesh:
Limits of CDCL Learning via Merge Resolution. SAT 2023: 27:1-27:19 - Front Matter, Table of Contents, Preface, Conference Organization. SAT 2023: 0:1-0:18
- Junping Zhou, Jiaxin Liang, Minghao Yin, Bo He:
LS-DTKMS: A Local Search Algorithm for Diversified Top-k MaxSAT Problem. SAT 2023: 29:1-29:16 - Neng-Fa Zhou, Ruiwei Wang, Roland H. C. Yap:
A Comparison of SAT Encodings for Acyclicity of Directed Graphs. SAT 2023: 30:1-30:9 - Meena Mahajan
, Friedrich Slivovsky:
26th International Conference on Theory and Applications of Satisfiability Testing, SAT 2023, July 4-8, 2023, Alghero, Italy. LIPIcs 271, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2023, ISBN 978-3-95977-286-0 [contents] - 2022
- Benjamin Böhm, Tomás Peitl, Olaf Beyersdorff:
Should Decisions in QCDCL Follow Prefix Order? SAT 2022: 11:1-11:19 - Pavel Smirnov, Jeremias Berg, Matti Järvisalo:
Improvements to the Implicit Hitting Set Approach to Pseudo-Boolean Optimization. SAT 2022: 13:1-13:18 - Josep Alos, Carlos Ansótegui, Josep M. Salvia, Eduard Torres:
OptiLog V2: Model, Solve, Tune and Run. SAT 2022: 25:1-25:16 - Markus Anders:
SAT Preprocessors and Symmetry. SAT 2022: 1:1-1:20 - Gilles Audemard, Jean-Marie Lagniez, Marie Miceli:
A New Exact Solver for (Weighted) Max#SAT. SAT 2022: 28:1-28:20 - Jakob Bach, Markus Iser, Klemens Böhm:
A Comprehensive Study of k-Portfolios of Recent SAT Solvers. SAT 2022: 2:1-2:18 - Max Bannach, Malte Skambath, Till Tantau:
On the Parallel Parameterized Complexity of MaxSAT Variants. SAT 2022: 19:1-19:19 - Lucas Berent, Lukas Burgholzer, Robert Wille:
Towards a SAT Encoding for Quantum Circuits: A Journey From Classical Circuits to Clifford Circuits and Beyond. SAT 2022: 18:1-18:17 - Armin Biere, Md. Solimul Chowdhury, Marijn J. H. Heule, Benjamin Kiesl, Michael W. Whalen:
Migrating Solver State. SAT 2022: 27:1-27:24 - Miguel Cabral, Mikolás Janota, Vasco Manquinho:
SAT-Based Leximax Optimisation Algorithms. SAT 2022: 29:1-29:19 - Leroy Chew, Marijn J. H. Heule:
Relating Existing Powerful Proof Systems for QBF. SAT 2022: 10:1-10:22 - Johannes Klaus Fichte, Markus Hecher, Valentin Roland:
Proofs for Propositional Model Counting. SAT 2022: 30:1-30:24 - Robert Ganian, Filip Pokrývka, André Schidler, Kirill Simonov, Stefan Szeider:
Weighted Model Counting with Twin-Width. SAT 2022: 15:1-15:17 - Iván Garzón, Pablo Mesejo, Jesús Giráldez-Cru:
On the Performance of Deep Generative Models of Realistic SAT Instances. SAT 2022: 3:1-3:19 - Stephan Gocht, Ruben Martins, Jakob Nordström, Andy Oertel:
Certified CNF Translations for Pseudo-Boolean Solving. SAT 2022: 16:1-16:25 - Dmitry Itsykson, Artur Riazanov, Petr Smirnov:
Tight Bounds for Tseitin Formulas. SAT 2022: 6:1-6:21 - Christoph Jabs, Jeremias Berg, Andreas Niskanen, Matti Järvisalo:
MaxSAT-Based Bi-Objective Boolean Optimization. SAT 2022: 12:1-12:23 - Mikolás Janota, Jelle Piepenbrock, Bartosz Piotrowski:
Towards Learning Quantifier Instantiation in SMT. SAT 2022: 7:1-7:18 - Jean Christoph Jung, Valentin Mayer-Eichberger, Abdallah Saffidine:
QBF Programming with the Modeling Language Bule. SAT 2022: 31:1-31:14 - Markus Kirchweger, Manfred Scheucher, Stefan Szeider:
A SAT Attack on Rota's Basis Conjecture. SAT 2022: 4:1-4:18 - Meena Mahajan, Gaurav Sood:
QBF Merge Resolution Is Powerful but Unnatural. SAT 2022: 22:1-22:19 - Stefan Mengel:
Changing Partitions in Rectangle Decision Lists. SAT 2022: 17:1-17:20 - Milan Mossé, Harry Sha, Li-Yang Tan:
A Generalization of the Satisfiability Coding Lemma and Its Applications. SAT 2022: 9:1-9:18 - Alexander Nadel:
Introducing Intel(R) SAT Solver. SAT 2022: 8:1-8:23 - Nina Narodytska, Nikolaj S. Bjørner:
Analysis of Core-Guided MaxSat Using Cores and Correction Sets. SAT 2022: 26:1-26:20
