The following pages link to CAQE (Q37655):
Displayed 20 items.
- Dependency learning for QBF (Q1680261) (← links)
- \({\textsf{QRAT}}^{+}\): generalizing QRAT by a more powerful QBF redundancy property (Q1799077) (← links)
- Skolem functions for DQBF (Q1990517) (← links)
- Building strategies into QBF proofs (Q2031411) (← links)
- Boolean functional synthesis: hardness and practical algorithms (Q2050108) (← links)
- Two SAT solvers for solving quantified Boolean formulas with an arbitrary number of quantifier alternations (Q2058378) (← links)
- Proof complexity of symbolic QBF reasoning (Q2118330) (← links)
- Solving dependency quantified Boolean formulas using quantifier localization (Q2148900) (← links)
- Combining resolution-path dependencies with dependency learning (Q2181941) (← links)
- Proof complexity of fragments of long-distance Q-resolution (Q2181942) (← 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)
- Incremental Determinization (Q2818028) (← links)
- Non-prenex QBF Solving Using Abstraction (Q2818029) (← links)
- Q-Resolution with Generalized Axioms (Q2818032) (← links)
- Encodings of Bounded Synthesis (Q3303904) (← links)
- (Q3304096) (← links)
- Planning with Incomplete Information in Quantified Answer Set Programming (Q5019607) (← links)
- (Q5020558) (← links)