The following pages link to HQSpre (Q40348):
Displayed 13 items.
- \({\textsf{QRAT}}^{+}\): generalizing QRAT by a more powerful QBF redundancy property (Q1799077) (← links)
- Building strategies into QBF proofs (Q2031411) (← links)
- Two SAT solvers for solving quantified Boolean formulas with an arbitrary number of quantifier alternations (Q2058378) (← links)
- Certified DQBF solving by definition extraction (Q2118343) (← links)
- DQBDD: an efficient BDD-based DQBF solver (Q2118347) (← links)
- Solving dependency quantified Boolean formulas using quantifier localization (Q2148900) (← links)
- Combining resolution-path dependencies with dependency learning (Q2181941) (← links)
- Clausal abstraction for DQBF (Q2181947) (← links)
- The 2016 and 2017 QBF solvers evaluations (QBFEVAL'16 and QBFEVAL'17) (Q2321317) (← links)
- Multi-linear strategy extraction for QBF expansion proofs via local soundness (Q2661367) (← links)
- Positional games and QBF: the corrective encoding (Q2661369) (← links)
- The (D)QBF Preprocessor HQSpre – Underlying Theory and Its Implementation1 (Q5015602) (← links)
- Planning with Incomplete Information in Quantified Answer Set Programming (Q5019607) (← links)