On Sequent Systems and Resolution for QBFs

DOI10.1007/978-3-642-31612-8_9zbMath1273.03161OpenAlexW2122908864MaRDI QIDQ2843326

Uwe Egly

Publication date: 12 August 2013

Published in: Theory and Applications of Satisfiability Testing – SAT 2012 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-31612-8_9

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) Complexity of proofs (03F20)

Related Items (9)

Long-distance Q-resolution with dependency schemes ⋮ A game characterisation of tree-like Q-resolution size ⋮ Quantified Constraints in Twenty Seventeen ⋮ Understanding cutting planes for QBFs ⋮ A Game Characterisation of Tree-like Q-resolution Size ⋮ On Stronger Calculi for QBFs ⋮ Lifting QBF Resolution Calculi to DQBF ⋮ Long Distance Q-Resolution with Dependency Schemes ⋮ Expansion-based QBF solving versus Q-resolution

This page was built for publication: On Sequent Systems and Resolution for QBFs