VSL 2014: VIENNA SUMMER OF LOGIC 2014

This page contains an index consisting of author-provided keywords.

A
Abstraction	Generic CDCL -- A Formalization of Modern Propositional Satisfiability Solvers
B
Boolean Cardinality	Incremental SAT-based Method with Native Boolean Cardinality Handling for the Hamiltonian Cycle Problem
C
CDCL algorithm	Generic CDCL -- A Formalization of Modern Propositional Satisfiability Solvers
clause sharing	Validating Unsatisfiability Results of Clause Sharing Parallel SAT Solvers
CNF formulas	New CNF Features and Formula Classification
CNF partitioning	Formula partitioning revisited
complexity analysis	Typical-case complexity and the SAT competitions
CSP	Instance-based Selection of CSP Solvers using Short Training
D
distributed computing	Dolius: A Distributed Parallel SAT Solving Framework
divide-and-conquer	Formula partitioning revisited
DQBF	iDQ: Instantiation-Based DQBF Solving
DQDIMACS	iDQ: Instantiation-Based DQBF Solving
E
EPR	iDQ: Instantiation-Based DQBF Solving
Experimentations	Post Mortem Analysis of SAT Solver Proofs
F
feature extraction	New CNF Features and Formula Classification
Fiduccia-Mattheyses algorithm	Formula partitioning revisited
framework	Dolius: A Distributed Parallel SAT Solving Framework
H
Hamiltonian Cycle Problem	Incremental SAT-based Method with Native Boolean Cardinality Handling for the Hamiltonian Cycle Problem
hypergraph partitioning	Formula partitioning revisited
I
Incremental SAT Solving	Incremental SAT-based Method with Native Boolean Cardinality Handling for the Hamiltonian Cycle Problem
instantiation	iDQ: Instantiation-Based DQBF Solving
M
machine learning	New CNF Features and Formula Classification
N
NEXPTIME	iDQ: Instantiation-Based DQBF Solving
P
parallel satisfiability solver	Validating Unsatisfiability Results of Clause Sharing Parallel SAT Solvers
Permutation Constraints	Incremental SAT-based Method with Native Boolean Cardinality Handling for the Hamiltonian Cycle Problem
Porfolio	Instance-based Selection of CSP Solvers using Short Training
Proofs	Post Mortem Analysis of SAT Solver Proofs
Q
QBF	iDQ: Instantiation-Based DQBF Solving
S
SAT	iDQ: Instantiation-Based DQBF Solving Post Mortem Analysis of SAT Solver Proofs
SAT competitions	Typical-case complexity and the SAT competitions
SAT encoding	Instance-based Selection of CSP Solvers using Short Training
SAT partitioning	Formula partitioning revisited
SAT platform	Dolius: A Distributed Parallel SAT Solving Framework
SAT proofs	Post Mortem Analysis of SAT Solver Proofs
SAT solvers	Typical-case complexity and the SAT competitions
SAT solving	Generic CDCL -- A Formalization of Modern Propositional Satisfiability Solvers New CNF Features and Formula Classification Post Mortem Analysis of SAT Solver Proofs
T
transition system	Generic CDCL -- A Formalization of Modern Propositional Satisfiability Solvers
typical-case complexity	Typical-case complexity and the SAT competitions
U
unsatisfiability proof	Validating Unsatisfiability Results of Clause Sharing Parallel SAT Solvers

Disclaimer | Powered by EasyChair Smart Program