Abstract is missing.
- Faster LRAT Checking Than Solving with CaDiCaLFlorian Pollitt, Mathias Fleury, Armin Biere. [doi]
- Validation of QBF Encodings with Winning StrategiesIrfansha Shaik, Maximilian Heisinger, Martina Seidl, Jaco van de Pol. [doi]
- QCDCL vs QBF Resolution: Further InsightsBenjamin Böhm 0001, Olaf Beyersdorff. [doi]
- Explaining SAT Solving Using Causal ReasoningJiong Yang 0002, Arijit Shaw, Teodora Baluta, Mate Soos, Kuldeep S. Meel. [doi]
- A Comparison of SAT Encodings for Acyclicity of Directed GraphsNeng-Fa Zhou, Ruiwei Wang, Roland H. C. Yap. [doi]
- QMusExt: A Minimal (Un)satisfiable Core Extractor for Quantified Boolean FormulasAndreas Plank, Martina Seidl. [doi]
- Learning Shorter Redundant Clauses in SDCL Using MaxSATAlbert Oliveras, Chunxiao Li 0002, Darryl Wu, Jonathan Chung 0003, Vijay Ganesh. [doi]
- IPASIR-UP: User Propagators for CDCLKatalin Fazekas, Aina Niemetz, Mathias Preiner, Markus Kirchweger, Stefan Szeider, Armin Biere. [doi]
- Effective Auxiliary Variables via Structured ReencodingAndrew Haberlandt, Harrison Green, Marijn J. H. Heule. [doi]
- Front Matter, Table of Contents, Preface, Conference Organization [doi]
- Solving Huge Instances with Intel(R) SAT SolverAlexander Nadel. [doi]
- Polynomial Calculus for MaxSATIlario Bonacina, Maria Luisa Bonet, Jordi Levy. [doi]
- On CNF Conversion for Disjoint SAT EnumerationGabriele Masina, Giuseppe Spallitta, Roberto Sebastiani. [doi]
- Bounds on BDD-Based Bucket EliminationStefan Mengel. [doi]
- Combining Cubic Dynamical Solvers with Make/Break Heuristics to Solve SATAnshujit Sharma, Matthew Burns, Michael C. Huang 0001. [doi]
- Cutting Planes Width and the Complexity of Graph Isomorphism RefutationsJacobo Torán, Florian Wörz. [doi]
- A SAT Solver's Opinion on the Erdős-Faber-Lovász ConjectureMarkus Kirchweger, Tomás Peitl, Stefan Szeider. [doi]
- CadiBack: Extracting Backbones with CaDiCaLArmin Biere, Nils Froleyks, Wenxi Wang. [doi]
- Limits of CDCL Learning via Merge ResolutionMarc Vinyals, Chunxiao Li 0002, Noah Fleming, Antonina Kolokolova, Vijay Ganesh. [doi]
- Proof Complexity of Propositional Model CountingOlaf Beyersdorff, Tim Hoffmann, Luc Nicolas Spachmann. [doi]
- AllSAT for Combinational CircuitsDror Fried, Alexander Nadel, Yogev Shalmon. [doi]
- UpMax: User Partitioning for MaxSATPedro Orvalho, Vasco M. Manquinho, Ruben Martins. [doi]
- Separating Incremental and Non-Incremental Bottom-Up CompilationAlexis de Colnet. [doi]
- Reducing Acceptance Marks in Emerson-Lei Automata by QBF SolvingTereza Schwarzová, Jan Strejcek, Juraj Major. [doi]
- An Analysis of Core-Guided Maximum Satisfiability Solvers Using Linear ProgrammingGeorge Katsirelos. [doi]
- LS-DTKMS: A Local Search Algorithm for Diversified Top-k MaxSAT ProblemJunping Zhou, Jiaxin Liang, Minghao Yin, Bo He. [doi]
- SAT-Based Generation of Planar GraphsMarkus Kirchweger, Manfred Scheucher, Stefan Szeider. [doi]
- On the Complexity of k-DQBFLong-Hin Fung, Tony Tan. [doi]
- Certified Knowledge Compilation with Application to Verified Model CountingRandal E. Bryant, Wojciech Nawrocki, Jeremy Avigad, Marijn J. H. Heule. [doi]
- Algorithms Transcending the SAT-Symmetry InterfaceMarkus Anders, Pascal Schweitzer, Mate Soos. [doi]
- Even Shorter Proofs Without New VariablesAdrián Rebola-Pardo. [doi]