- Andreas Niskanen
, Jeremias Berg, Matti Järvisalo:
Incremental Maximum Satisfiability. SAT 2022: 14:1-14:19 - Franz-Xaver Reichl, Friedrich Slivovsky:
Pedant: A Certifying DQBF Solver. SAT 2022: 20:1-20:10 - Agnes Schleitzer, Olaf Beyersdorff:
Classes of Hard Formulas for QBF Resolution. SAT 2022: 5:1-5:18 - Friedrich Slivovsky:
Quantified CDCL with Universal Resolution. SAT 2022: 24:1-24:16 - Bernardo Subercaseaux, Marijn J. H. Heule:
The Packing Chromatic Number of the Infinite Square Grid Is at Least 14. SAT 2022: 21:1-21:16 - Hao-Ren Wang, Kuan-Hua Tu, Jie-Hong Roland Jiang, Christoph Scholl:
Quantifier Elimination in Stochastic Boolean Satisfiability. SAT 2022: 23:1-23:17 - Front Matter, Table of Contents, Preface, Conference Organization. SAT 2022: 0:1-0:18
- Kuldeep S. Meel, Ofer Strichman:
25th International Conference on Theory and Applications of Satisfiability Testing, SAT 2022, August 2-5, 2022, Haifa, Israel. LIPIcs 236, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2022, ISBN 978-3-95977-242-6 [contents] - 2021
- Carlos Ansótegui, Jesus Ojeda, António Pacheco, Josep Pon, Josep M. Salvia, Eduard Torres:
OptiLog: A Framework for SAT-based Systems. SAT 2021: 1-10 - Carlos Ansótegui, Josep Pon, Meinolf Sellmann, Kevin Tierney:
PyDGGA: Distributed GGA for Automatic Configuration. SAT 2021: 11-20 - Daniel Le Berre, Romain Wallon:
On Dedicated CDCL Strategies for PB Solvers. SAT 2021: 315-331 - Olaf Beyersdorff, Luca Pulina, Martina Seidl, Ankit Shukla:
QBFFam: A Tool for Generating QBF Families from Proof Complexity. SAT 2021: 21-29 - Joshua Blinkhorn, Tomás Peitl, Friedrich Slivovsky:
Davis and Putnam Meet Henkin: Solving DQBF with Resolution. SAT 2021: 30-46 - Benjamin Böhm, Olaf Beyersdorff:
Lower Bounds for QCDCL via Formula Gauge. SAT 2021: 47-63 - Shaowei Cai, Xindi Zhang:
Deep Cooperation of CDCL and Local Search for SAT. SAT 2021: 64-81 - Henrik E. C. Cao:
Hash-Based Preprocessing and Inprocessing Techniques in SAT Solvers. SAT 2021: 82-97 - Leroy Chew:
Hardness and Optimality in QBF Proof Systems Modulo NP. SAT 2021: 98-115 - Alexis de Colnet, Stefan Mengel:
Characterizing Tseitin-Formulas with Short Regular Resolution Refutations. SAT 2021: 116-133 - Paulius Dilkas, Vaishak Belle:
Weighted Model Counting Without Parameter Variables. SAT 2021: 134-151 - Jeffrey M. Dudek, Vu H. N. Phan, Moshe Y. Vardi:
ProCount: Weighted Projected Model Counting with Graded Project-Join Trees. SAT 2021: 152-170 - Mathias Fleury, Armin Biere:
Efficient All-UIP Learned Clause Minimization. SAT 2021: 171-187 - Tobias Friedrich, Frank Neumann, Ralf Rothenberger, Andrew M. Sutton:
Solving Non-uniform Planted and Filtered Random SAT Formulas Greedily. SAT 2021: 188-206 - Miki Hermann, Gernot Salzer:
MCP: Capturing Big Data by Satisfiability (Tool Description). SAT 2021: 207-215 - Marijn J. H. Heule:
Chinese Remainder Encoding for Hamiltonian Cycles. SAT 2021: 216-224 - Pei Huang, Rundong Li, Minghao Liu, Feifei Ma, Jian Zhang:
Efficient SAT-Based Minimal Model Generation Methods for Modal Logic S5. SAT 2021: 225-241 - Norbert Hundeshagen, Martin Lange, Georg Siebert:
DiMo - Discrete Modelling Using Propositional Logic. SAT 2021: 242-250 - Alexey Ignatiev, João Marques-Silva:
SAT-Based Rigorous Explanations for Decision Lists. SAT 2021: 251-269 - Jiwei Jin, Yiqi Lv, Cunjing Ge, Feifei Ma, Jian Zhang:
Investigating the Existence of Costas Latin Squares via Satisfiability Testing. SAT 2021: 270-279 - Stepan Kochemazov, Alexey Ignatiev, João Marques-Silva:
Assessing Progress in SAT Solvers Through the Lens of Incremental SAT. SAT 2021: 280-298 - Oliver Kullmann, Oleg Zaikin:
Projection Heuristics for Binary Branchings Between Sum and Product. SAT 2021: 299-314
