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 |