PROGRAM
Days: Wednesday, July 5th Thursday, July 6th Friday, July 7th Saturday, July 8th
Wednesday, July 5th
View this program: with abstractssession overviewtalk overview
09:30-10:50 Session 2: Contributed Talks 1
Chair:
09:30 | A Comparison of SAT Encodings for Acyclicity of Directed Graphs (abstract) |
09:50 | SAT-Based Generation of Planar Graphs (abstract) PRESENTER: Markus Kirchweger |
10:20 | Effective Auxiliary Variables via Structured Reencoding (abstract) |
11:30-12:30 Session 3: Invited Talk 1
Chair:
11:30 | Algorithmic Complexity of Certified Unsatisfiability |
14:00-15:20 Session 4: Contributed Talks 2
Chair:
14:00 | Separating Incremental and Non-Incremental Bottom-Up Compilation (abstract) |
14:30 | Bounds on BDD-Based Bucket Elimination (abstract) |
14:50 | Limits of CDCL Learning via Merge Resolution (abstract) PRESENTER: Marc Vinyals |
16:00-17:30 Session 5: Contributed Talks 3
Chair:
16:00 | Proof Complexity of Propositional Model Counting (abstract) PRESENTER: Tim Hoffmann |
16:30 | AllSAT for Combinational Circuits (abstract) PRESENTER: Yogev Shalmon |
17:00 | On CNF Conversion for Disjoint SAT Enumeration (abstract) PRESENTER: Gabriele Masina |
Thursday, July 6th
View this program: with abstractssession overviewtalk overview
09:30-11:00 Session 6: Contributed Talks 4
Chair:
09:30 | Certified Knowledge Compilation with Application to Verified Model Counting (abstract) |
10:00 | A SAT Solver’s Opinion on the Erdős-Faber-Lovász Conjecture (abstract) PRESENTER: Tomáš Peitl |
10:30 | Reducing Acceptance Marks in Emerson-Lei Automata by QBF Solving (abstract) PRESENTER: Tereza Schwarzová |
14:00-15:00 Session 8: Contributed Talks 5
Chair:
14:00 | Combining Cubic Dynamical Solvers with Make/Break Heuristics to Solve SAT (abstract) PRESENTER: Matthew Burns |
14:30 | Explaining SAT Solving Using Causal Reasoning (abstract) |
15:30-16:30 Session 9: Contributed Talks 6
Chair:
15:30 | Even shorter proofs without new variables (abstract) |
16:00 | Algorithms Transcending the SAT-Symmetry Interface (abstract) PRESENTER: Markus Anders |
Friday, July 7th
View this program: with abstractssession overviewtalk overview
09:30-11:00 Session 10: Contributed Talks 7
Chair:
09:30 | On the complexity of k-DQBF (abstract) |
10:00 | Polynomial Calculus for MaxSAT (abstract) |
10:30 | Cutting Planes Width and the Complexity of Graph Isomorphism Refutations (abstract) |
14:00-15:20 Session 12: Contributed Talks 8
Chair:
14:00 | Solving Huge Instances with Intel(R) SAT Solver (abstract) |
14:20 | Faster LRAT Checking than Solving with CaDiCaL (abstract) |
14:40 | CadiBack: Extracting Backbones with CaDiCaL (abstract) |
15:00 | IPASIR-UP: User Propagators for CDCL (abstract) PRESENTER: Katalin Fazekas |
Saturday, July 8th
View this program: with abstractssession overviewtalk overview
09:30-11:20 Session 15: Contributed Talks 9
Chair:
09:30 | LS-DTKMS: A Local Search Algorithm for Diversified Top-k MaxSAT Problem (abstract) |
10:00 | UpMax: User partitioning for MaxSAT (abstract) PRESENTER: Pedro Orvalho |
10:20 | An Analysis of Core-guided Maximum Satisfiability Solvers Using Linear Programming (abstract) |
10:50 | Learning Shorter Redundant Clauses in SDCL Using MaxSAT (abstract) PRESENTER: Albert Oliveras |
11:50-13:00 Session 16: Contributed Talks 10
Chair:
11:50 | QCDCL vs QBF Resolution: Further Insights (abstract) |
12:20 | Validation of QBF Encodings with Winning Strategies (abstract) |
12:40 | QMusExt: A Minimal (Un)satisfiable Core Extractor for Quantified Boolean Formulas (abstract) |