SAT

Keyphrases

Publications

2023

Long-Hin Fung, Tony Tan
On the Complexity of k-DQBF. SAT (2023)
Dror Fried, Alexander Nadel, Yogev Shalmon
AllSAT for Combinational Circuits. SAT (2023)
George Katsirelos
An Analysis of Core-Guided Maximum Satisfiability Solvers Using Linear Programming. SAT (2023)
Florian Pollitt, Mathias Fleury, Armin Biere
Faster LRAT Checking Than Solving with CaDiCaL. SAT (2023)
Randal E. Bryant, Wojciech Nawrocki, Jeremy Avigad, Marijn J. H. Heule
Certified Knowledge Compilation with Application to Verified Model Counting. SAT (2023)
Jacobo Torán, Florian Wörz
Cutting Planes Width and the Complexity of Graph Isomorphism Refutations. SAT (2023)
Markus Kirchweger, Tomás Peitl, Stefan Szeider
A SAT Solver's Opinion on the Erdős-Faber-Lovász Conjecture. SAT (2023)
Adrián Rebola-Pardo
Even Shorter Proofs Without New Variables. SAT (2023)
Andreas Plank, Martina Seidl
QMusExt: A Minimal (Un)satisfiable Core Extractor for Quantified Boolean Formulas. SAT (2023)
Armin Biere, Nils Froleyks, Wenxi Wang
CadiBack: Extracting Backbones with CaDiCaL. SAT (2023)
Irfansha Shaik, Maximilian Heisinger, Martina Seidl, Jaco van de Pol
Validation of QBF Encodings with Winning Strategies. SAT (2023)
Neng-Fa Zhou, Ruiwei Wang, Roland H. C. Yap
A Comparison of SAT Encodings for Acyclicity of Directed Graphs. SAT (2023)
Benjamin Böhm, Olaf Beyersdorff
QCDCL vs QBF Resolution: Further Insights. SAT (2023)
Albert Oliveras, Chunxiao Li, Darryl Wu, Jonathan Chung, Vijay Ganesh
Learning Shorter Redundant Clauses in SDCL Using MaxSAT. SAT (2023)
Front Matter, Table of Contents, Preface, Conference Organization. SAT (2023)
Ilario Bonacina, Maria Luisa Bonet, Jordi Levy
Polynomial Calculus for MaxSAT. SAT (2023)
Alexis de Colnet
Separating Incremental and Non-Incremental Bottom-Up Compilation. SAT (2023)
Stefan Mengel
Bounds on BDD-Based Bucket Elimination. SAT (2023)
Anshujit Sharma, Matthew Burns, Michael C. Huang
Combining Cubic Dynamical Solvers with Make/Break Heuristics to Solve SAT. SAT (2023)
Markus Anders, Pascal Schweitzer, Mate Soos
Algorithms Transcending the SAT-Symmetry Interface. SAT (2023)
Marc Vinyals, Chunxiao Li, Noah Fleming, Antonina Kolokolova, Vijay Ganesh
Limits of CDCL Learning via Merge Resolution. SAT (2023)
Olaf Beyersdorff, Tim Hoffmann, Luc Nicolas Spachmann
Proof Complexity of Propositional Model Counting. SAT (2023)
Junping Zhou, Jiaxin Liang, Minghao Yin, Bo He
LS-DTKMS: A Local Search Algorithm for Diversified Top-k MaxSAT Problem. SAT (2023)
Jiong Yang, Arijit Shaw, Teodora Baluta, Mate Soos, Kuldeep S. Meel
Explaining SAT Solving Using Causal Reasoning. SAT (2023)
Andrew Haberlandt, Harrison Green, Marijn J. H. Heule
Effective Auxiliary Variables via Structured Reencoding. SAT (2023)
Tereza Schwarzová, Jan Strejcek, Juraj Major
Reducing Acceptance Marks in Emerson-Lei Automata by QBF Solving. SAT (2023)
Pedro Orvalho, Vasco M. Manquinho, Ruben Martins
UpMax: User Partitioning for MaxSAT. SAT (2023)
Markus Kirchweger, Manfred Scheucher, Stefan Szeider
SAT-Based Generation of Planar Graphs. SAT (2023)
Gabriele Masina, Giuseppe Spallitta, Roberto Sebastiani
On CNF Conversion for Disjoint SAT Enumeration. SAT (2023)
Katalin Fazekas, Aina Niemetz, Mathias Preiner, Markus Kirchweger, Stefan Szeider, Armin Biere
IPASIR-UP: User Propagators for CDCL. SAT (2023)
Alexander Nadel
Solving Huge Instances with Intel(R) SAT Solver. SAT (2023)

volume 271, 2023

26th International Conference on Theory and Applications of Satisfiability Testing, SAT 2023, July 4-8, 2023, Alghero, Italy SAT 271 (2023)

2022

volume 236, 2022

25th International Conference on Theory and Applications of Satisfiability Testing, SAT 2022, August 2-5, 2022, Haifa, Israel. SAT 236 (2022)