Talk Author Index

TALK AUTHOR INDEX

Shortcuts: A B F H J K L M P R S T V

A
Alfonso, Enrique	New CNF Features and Formula Classification
Audemard, Gilles	Dolius: A Distributed Parallel SAT Solving Framework
B
Banbara, Mutsunori	Incremental SAT-based Method with Native Boolean Cardinality Handling for the Hamiltonian Cycle Problem
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, Saïd	Dolius: A Distributed Parallel SAT Solving Framework
K
Kovásznai, Gergely	iDQ: Instantiation-Based DQBF Solving
L
Le Berre, Daniel	Incremental SAT-based Method with Native Boolean Cardinality Handling for the Hamiltonian Cycle Problem
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
Maric, Filip	Instance-based Selection of CSP Solvers using Short Training
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
R
Roussel, Stéphanie	Incremental SAT-based Method with Native Boolean Cardinality Handling for the Hamiltonian Cycle Problem
S
Simon, Laurent	Post Mortem Analysis of SAT Solver Proofs
Soh, Takehide	Incremental SAT-based Method with Native Boolean Cardinality Handling for the Hamiltonian Cycle Problem
Steinke, Peter	Generic CDCL -- A Formalization of Modern Propositional Satisfiability Solvers
Stojadinovic, Mirko	Instance-based Selection of CSP Solvers using Short Training
T
Tamura, Naoyuki	Incremental SAT-based Method with Native Boolean Cardinality Handling for the Hamiltonian Cycle Problem
V
Veith, Helmut	iDQ: Instantiation-Based DQBF Solving