POS PROGRAM
Sunday, July 13th, 2014
View this program: with abstractssession overviewtalk overviewside by side with other conferences
09:15-10:15 Session 24B: Parallel SAT
Location: FH, Hörsaal 3
09:15 | Dolius: A Distributed Parallel SAT Solving Framework (abstract) |
09:45 | Validating Unsatisfiability Results of Clause Sharing Parallel SAT Solvers (abstract) |
10:15-10:45Coffee Break
10:45-13:00 Session 26M: Analysis
Location: FH, Hörsaal 3
10:45 | Post Mortem Analysis of SAT Solver Proofs (abstract) |
11:15 | Formula partitioning revisited (abstract) |
11:45 | New CNF Features and Formula Classification (abstract) |
12:15 | Typical-case complexity and the SAT competitions (abstract) |
13:00-14:30Lunch Break
14:30-15:30 Session 31J: Invited talk
Chair:
Location: FH, Hörsaal 3
14:30 | Lingeling Essentials, A Tutorial on Design and Implementation Aspects of the the SAT Solver Lingeling (abstract) |
15:30-16:00 Session 33C: Formalization
Location: FH, Hörsaal 3
15:30 | Generic CDCL -- A Formalization of Modern Propositional Satisfiability Solvers (abstract) |
16:00-16:30Coffee Break
16:30-18:00 Session 34L: Applications and closing
Location: FH, Hörsaal 3
16:30 | iDQ: Instantiation-Based DQBF Solving (abstract) |
17:00 | Instance-based Selection of CSP Solvers using Short Training (abstract) |
17:30 | Incremental SAT-based Method with Native Boolean Cardinality Handling for the Hamiltonian Cycle Problem (abstract) |