POS 2014 PROCEEDINGS: KEYWORD INDEX

Papers Papers with Abstracts Preface Author Index Keyword Index

Shortcuts: A C D E F H M P S T U

A
abstraction	Generic CDCL -- A Formalization of Modern Propositional Satisfiability Solvers (PDF, talk)
C
CDCL algorithm	Generic CDCL -- A Formalization of Modern Propositional Satisfiability Solvers (PDF, talk)
clause sharing	Validating Unsatisfiability Results of Clause Sharing Parallel SAT Solvers (PDF, talk)
CNF formulas	New CNF Features and Formula Classification (PDF, talk)
CNF partitioning	Formula partitioning revisited (PDF, talk)
complexity analysis	Typical-case complexity and the SAT competitions (PDF, talk)
D
distributed computing	Dolius: A Distributed Parallel SAT Solving Framework (PDF, talk)
divide-and-conquer	Formula partitioning revisited (PDF, talk)
E
Experimentations	Post Mortem Analysis of SAT Solver Proofs (PDF, talk)
F
feature extraction	New CNF Features and Formula Classification (PDF, talk)
Fiduccia-Mattheyses algorithm	Formula partitioning revisited (PDF, talk)
framework	Dolius: A Distributed Parallel SAT Solving Framework (PDF, talk)
H
hypergraph partitioning	Formula partitioning revisited (PDF, talk)
M
machine learning	New CNF Features and Formula Classification (PDF, talk)
P
parallel satisfiability solver	Validating Unsatisfiability Results of Clause Sharing Parallel SAT Solvers (PDF, talk)
Proofs	Post Mortem Analysis of SAT Solver Proofs (PDF, talk)
S
SAT	Post Mortem Analysis of SAT Solver Proofs (PDF, talk)
SAT competitions	Typical-case complexity and the SAT competitions (PDF, talk)
SAT partitioning	Formula partitioning revisited (PDF, talk)
SAT platform	Dolius: A Distributed Parallel SAT Solving Framework (PDF, talk)
SAT solvers	Typical-case complexity and the SAT competitions (PDF, talk)
SAT solving	New CNF Features and Formula Classification (PDF, talk) Generic CDCL -- A Formalization of Modern Propositional Satisfiability Solvers (PDF, talk)
T
transition system	Generic CDCL -- A Formalization of Modern Propositional Satisfiability Solvers (PDF, talk)
typical-case complexity	Typical-case complexity and the SAT competitions (PDF, talk)
U
unsatisfiability proof	Validating Unsatisfiability Results of Clause Sharing Parallel SAT Solvers (PDF, talk)