default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID25th SAT 2022: Haifa, Israel
- Kuldeep S. Meel
, Ofer Strichman:
25th International Conference on Theory and Applications of Satisfiability Testing, SAT 2022, Haifa, Israel, August 2-5, 2022. LIPIcs 236, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2022, ISBN 978-3-95977-242-6 - Front Matter, Table of Contents, Preface, Conference Organization. 0:1-0:18
- Markus Anders:
SAT Preprocessors and Symmetry. 1:1-1:20 - Jakob Bach, Markus Iser, Klemens Böhm:
A Comprehensive Study of k-Portfolios of Recent SAT Solvers. 2:1-2:18 - Iván Garzón, Pablo Mesejo, Jesús Giráldez-Cru:
On the Performance of Deep Generative Models of Realistic SAT Instances. 3:1-3:19 - Markus Kirchweger, Manfred Scheucher, Stefan Szeider:
A SAT Attack on Rota's Basis Conjecture. 4:1-4:18 - Agnes Schleitzer, Olaf Beyersdorff:
Classes of Hard Formulas for QBF Resolution. 5:1-5:18 - Dmitry Itsykson, Artur Riazanov, Petr Smirnov:
Tight Bounds for Tseitin Formulas. 6:1-6:21 - Mikolás Janota, Jelle Piepenbrock, Bartosz Piotrowski:
Towards Learning Quantifier Instantiation in SMT. 7:1-7:18 - Alexander Nadel:
Introducing Intel(R) SAT Solver. 8:1-8:23 - Milan Mossé, Harry Sha, Li-Yang Tan:
A Generalization of the Satisfiability Coding Lemma and Its Applications. 9:1-9:18 - Leroy Chew, Marijn J. H. Heule:
Relating Existing Powerful Proof Systems for QBF. 10:1-10:22 - Benjamin Böhm, Tomás Peitl, Olaf Beyersdorff:
Should Decisions in QCDCL Follow Prefix Order? 11:1-11:19 - Christoph Jabs, Jeremias Berg, Andreas Niskanen, Matti Järvisalo:
MaxSAT-Based Bi-Objective Boolean Optimization. 12:1-12:23 - Pavel Smirnov, Jeremias Berg, Matti Järvisalo:
Improvements to the Implicit Hitting Set Approach to Pseudo-Boolean Optimization. 13:1-13:18 - Andreas Niskanen, Jeremias Berg, Matti Järvisalo:
Incremental Maximum Satisfiability. 14:1-14:19 - Robert Ganian, Filip Pokrývka, André Schidler, Kirill Simonov, Stefan Szeider:
Weighted Model Counting with Twin-Width. 15:1-15:17 - Stephan Gocht, Ruben Martins, Jakob Nordström, Andy Oertel:
Certified CNF Translations for Pseudo-Boolean Solving. 16:1-16:25 - Stefan Mengel:
Changing Partitions in Rectangle Decision Lists. 17:1-17:20 - Lucas Berent, Lukas Burgholzer, Robert Wille:
Towards a SAT Encoding for Quantum Circuits: A Journey From Classical Circuits to Clifford Circuits and Beyond. 18:1-18:17 - Max Bannach, Malte Skambath, Till Tantau:
On the Parallel Parameterized Complexity of MaxSAT Variants. 19:1-19:19 - Franz-Xaver Reichl, Friedrich Slivovsky:
Pedant: A Certifying DQBF Solver. 20:1-20:10 - Bernardo Subercaseaux, Marijn J. H. Heule:
The Packing Chromatic Number of the Infinite Square Grid Is at Least 14. 21:1-21:16 - Meena Mahajan, Gaurav Sood:
QBF Merge Resolution Is Powerful but Unnatural. 22:1-22:19 - Hao-Ren Wang, Kuan-Hua Tu, Jie-Hong Roland Jiang, Christoph Scholl:
Quantifier Elimination in Stochastic Boolean Satisfiability. 23:1-23:17 - Friedrich Slivovsky:
Quantified CDCL with Universal Resolution. 24:1-24:16 - Josep Alos, Carlos Ansótegui, Josep M. Salvia, Eduard Torres:
OptiLog V2: Model, Solve, Tune and Run. 25:1-25:16 - Nina Narodytska, Nikolaj S. Bjørner:
Analysis of Core-Guided MaxSat Using Cores and Correction Sets. 26:1-26:20 - Armin Biere, Md. Solimul Chowdhury, Marijn J. H. Heule, Benjamin Kiesl, Michael W. Whalen:
Migrating Solver State. 27:1-27:24 - Gilles Audemard, Jean-Marie Lagniez, Marie Miceli:
A New Exact Solver for (Weighted) Max#SAT. 28:1-28:20 - Miguel Cabral, Mikolás Janota, Vasco Manquinho:
SAT-Based Leximax Optimisation Algorithms. 29:1-29:19 - Johannes Klaus Fichte, Markus Hecher, Valentin Roland:
Proofs for Propositional Model Counting. 30:1-30:24 - Jean Christoph Jung, Valentin Mayer-Eichberger, Abdallah Saffidine:
QBF Programming with the Modeling Language Bule. 31:1-31:14
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-11-26 07:51 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
