Birs- 14w5101: Theoretical Foundations of Applied SAT Solving
-
Title: Satisfiability-based set membership filters
Speaker:
Link:
-
Title: Saucy3: Fast Symmetry Discovery in Graphs
Speaker:
Link:
-
Title: Exact model counting: SAT-solver based methods versus lifted inference
Speaker:
Link:
-
Title: Space complexity in algebraic proof systems
Speaker:
Link:
-
Title: Narrow proofs may be maximally long
Speaker:
Link:
-
Title: Lower bounds for width-restricted clause learning
Speaker:
Link:
-
Title: From theoretical potential to applied impact — could/should we get more interaction between practitioners and theoreticians and if so how?
Speaker:
Link:
-
Title: Abstraction and multi-encodings in SAT
Speaker:
Link:
-
Title: Unit-clause propagation and monotone circuits
Speaker:
Link:
-
Title: Strong ETH holds for regular resolution
Speaker:
Link:
-
Title: Detecting traditional packing, decisively
Speaker:
Link:
-
Title: Timed PageRank and branching heuristics in CDCL SAT solvers
Speaker:
Link: