- Jinqiang Yu, Graham Farr, Alexey Ignatiev, Peter J. Stuckey:
Anytime Approximate Formal Feature Attribution. SAT 2024: 30:1-30:23 - Tianwei Zhang, Tomás Peitl, Stefan Szeider:
Small Unsatisfiable k-CNFs with Bounded Literal Occurrence. SAT 2024: 31:1-31:22 - Supratik Chakraborty
, Jie-Hong Roland Jiang:
27th International Conference on Theory and Applications of Satisfiability Testing, SAT 2024, August 21-24, 2024, Pune, India. LIPIcs 305, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2024, ISBN 978-3-95977-334-8 [contents] - 2023
- Benjamin Böhm, Olaf Beyersdorff:
QCDCL vs QBF Resolution: Further Insights. SAT 2023: 4:1-4:17 - Jiong Yang, Arijit Shaw, Teodora Baluta, Mate Soos, Kuldeep S. Meel:
Explaining SAT Solving Using Causal Reasoning. SAT 2023: 28:1-28:19 - Markus Anders, Pascal Schweitzer, Mate Soos:
Algorithms Transcending the SAT-Symmetry Interface. SAT 2023: 1:1-1:21 - Olaf Beyersdorff, Tim Hoffmann, Luc Nicolas Spachmann:
Proof Complexity of Propositional Model Counting. SAT 2023: 2:1-2:18 - Armin Biere, Nils Froleyks, Wenxi Wang:
CadiBack: Extracting Backbones with CaDiCaL. SAT 2023: 3:1-3:12 - Ilario Bonacina, Maria Luisa Bonet, Jordi Levy:
Polynomial Calculus for MaxSAT. SAT 2023: 5:1-5:17 - Randal E. Bryant, Wojciech Nawrocki, Jeremy Avigad, Marijn J. H. Heule:
Certified Knowledge Compilation with Application to Verified Model Counting. SAT 2023: 6:1-6:20 - Alexis de Colnet:
Separating Incremental and Non-Incremental Bottom-Up Compilation. SAT 2023: 7:1-7:20 - Katalin Fazekas, Aina Niemetz, Mathias Preiner, Markus Kirchweger, Stefan Szeider, Armin Biere:
IPASIR-UP: User Propagators for CDCL. SAT 2023: 8:1-8:13 - Dror Fried, Alexander Nadel, Yogev Shalmon:
AllSAT for Combinational Circuits. SAT 2023: 9:1-9:18 - Long-Hin Fung, Tony Tan:
On the Complexity of k-DQBF. SAT 2023: 10:1-10:15 - Andrew Haberlandt, Harrison Green, Marijn J. H. Heule:
Effective Auxiliary Variables via Structured Reencoding. SAT 2023: 11:1-11:19 - George Katsirelos:
An Analysis of Core-Guided Maximum Satisfiability Solvers Using Linear Programming. SAT 2023: 12:1-12:19 - Markus Kirchweger, Tomás Peitl, Stefan Szeider:
A SAT Solver's Opinion on the Erdős-Faber-Lovász Conjecture. SAT 2023: 13:1-13:17 - Markus Kirchweger, Manfred Scheucher, Stefan Szeider:
SAT-Based Generation of Planar Graphs. SAT 2023: 14:1-14:18 - Gabriele Masina, Giuseppe Spallitta, Roberto Sebastiani:
On CNF Conversion for Disjoint SAT Enumeration. SAT 2023: 15:1-15:16 - Stefan Mengel:
Bounds on BDD-Based Bucket Elimination. SAT 2023: 16:1-16:11 - Alexander Nadel:
Solving Huge Instances with Intel(R) SAT Solver. SAT 2023: 17:1-17:12 - Albert Oliveras, Chunxiao Li, Darryl Wu, Jonathan Chung, Vijay Ganesh:
Learning Shorter Redundant Clauses in SDCL Using MaxSAT. SAT 2023: 18:1-18:17 - Pedro Orvalho, Vasco Manquinho, Ruben Martins:
UpMax: User Partitioning for MaxSAT. SAT 2023: 19:1-19:13 - Andreas Plank, Martina Seidl:
QMusExt: A Minimal (Un)satisfiable Core Extractor for Quantified Boolean Formulas. SAT 2023: 20:1-20:10 - Florian Pollitt, Mathias Fleury, Armin Biere:
Faster LRAT Checking Than Solving with CaDiCaL. SAT 2023: 21:1-21:12 - Adrián Rebola-Pardo:
Even Shorter Proofs Without New Variables. SAT 2023: 22:1-22:20 - Tereza Schwarzová, Jan Strejcek, Juraj Major:
Reducing Acceptance Marks in Emerson-Lei Automata by QBF Solving. SAT 2023: 23:1-23:20 - Irfansha Shaik, Maximilian Heisinger, Martina Seidl, Jaco van de Pol:
Validation of QBF Encodings with Winning Strategies. SAT 2023: 24:1-24:10 - Anshujit Sharma, Matthew Burns, Michael C. Huang:
Combining Cubic Dynamical Solvers with Make/Break Heuristics to Solve SAT. SAT 2023: 25:1-25:21 - Jacobo Torán, Florian Wörz:
Cutting Planes Width and the Complexity of Graph Isomorphism Refutations. SAT 2023: 26:1-26:20
