| a |
| abstraction | Generic CDCL -- A Formalization of Modern Propositional Satisfiability Solvers |
| 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 |
| 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 |
| f |
| feature extraction | New CNF Features and Formula Classification |
| Fiduccia-Mattheyses algorithm | Formula partitioning revisited |
| Framework | Dolius: A Distributed Parallel SAT Solving Framework |
| h |
| hypergraph partitioning | Formula partitioning revisited |
| i |
| Instantiation | iDQ: Instantiation-Based DQBF Solving |
| m |
| machine learning | New CNF Features and Formula Classification |
| p |
| parallel satisfiability solver | Validating Unsatisfiability Results of Clause Sharing Parallel SAT Solvers |
| q |
| QBF | iDQ: Instantiation-Based DQBF Solving |
| s |
| SAT | Post Mortem Analysis of SAT Solver Proofs
iDQ: Instantiation-Based DQBF Solving |
| SAT competitions | Typical-case complexity and the SAT competitions |
| 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 | Post Mortem Analysis of SAT Solver Proofs
New CNF Features and Formula Classification
Generic CDCL -- A Formalization of Modern Propositional Satisfiability Solvers |
| 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 |
