Birs- 14w5101: Theoretical Foundations of Applied SAT Solving

  1. Title:
    Satisfiability-based set membership filters

    Speaker:

    Link:

  2. Title:
    Saucy3: Fast Symmetry Discovery in Graphs

    Speaker:

    Link:

  3. Title:
    Exact model counting: SAT-solver based methods versus lifted inference

    Speaker:

    Link:

  4. Title:
    Space complexity in algebraic proof systems

    Speaker:

    Link:

  5. Title:
    Narrow proofs may be maximally long

    Speaker:

    Link:

  6. Title:
    Lower bounds for width-restricted clause learning

    Speaker:

    Link:

  7. Title:
    From theoretical potential to applied impact — could/should we get more interaction between practitioners and theoreticians and if so how?

    Speaker:

    Link:

  8. Title:
    Abstraction and multi-encodings in SAT

    Speaker:

    Link:

  9. Title:
    Unit-clause propagation and monotone circuits

    Speaker:

    Link:

  10. Title:
    Strong ETH holds for regular resolution

    Speaker:

    Link:

  11. Title:
    Detecting traditional packing, decisively

    Speaker:

    Link:

  12. Title:
    Timed PageRank and branching heuristics in CDCL SAT solvers

    Speaker:

    Link: