|
|
POS-14: Author Index| Author | Papers |
|---|
| A | | Audemard, Gilles | Dolius: A Distributed Parallel SAT Solving Framework | | B | | Biere, Armin | Lingeling Essentials, A Tutorial on Design and Implementation Aspects of the the SAT Solver Lingeling iDQ: Instantiation-Based DQBF Solving | | F | | Fröhlich, Andreas | iDQ: Instantiation-Based DQBF Solving | | H | | Heule, Marijn | Validating Unsatisfiability Results of Clause Sharing Parallel SAT Solvers | | Hoessen, Benoît | Dolius: A Distributed Parallel SAT Solving Framework | | Hölldobler, Steffen | Generic CDCL -- A Formalization of Modern Propositional Satisfiability Solvers | | J | | Jabbour, Said | Dolius: A Distributed Parallel SAT Solving Framework | | K | | Kovásznai, Gergely | iDQ: Instantiation-Based DQBF Solving | | M | | Mann, Zoltan | Formula partitioning revisited Typical-case complexity and the SAT competitions | | Manthey, Norbert | Validating Unsatisfiability Results of Clause Sharing Parallel SAT Solvers New CNF Features and Formula Classification Generic CDCL -- A Formalization of Modern Propositional Satisfiability Solvers | | Matos Alfonso, Enrique | New CNF Features and Formula Classification | | P | | Papp, Pal | Formula partitioning revisited | | Philipp, Tobias | Validating Unsatisfiability Results of Clause Sharing Parallel SAT Solvers Generic CDCL -- A Formalization of Modern Propositional Satisfiability Solvers | | Piette, Cédric | Dolius: A Distributed Parallel SAT Solving Framework | | S | | Simon, Laurent | Post Mortem Analysis of SAT Solver Proofs | | Steinke, Peter | Generic CDCL -- A Formalization of Modern Propositional Satisfiability Solvers | | V | | Veith, Helmut | iDQ: Instantiation-Based DQBF Solving |
|
|
|