QBF proof complexity
Quantified Boolean Formulas (QBF) and their proof complexity are not as well understood as propositional formulas, yet remain an area of interest due to their relation to QBF solving. Proof systems for QBF provide a theoretical underpinning for the performance of these solvers. We define a novel cal...
| Main Author: | |
|---|---|
| Other Authors: | |
| Published: |
University of Leeds
2017
|
| Subjects: | |
| Online Access: | https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.723199 |