On Stronger Calculi for QBFs

DOI10.1007/978-3-319-40970-2_26zbMath1475.68434arXiv1604.06483OpenAlexW2494237651MaRDI QIDQ2818031

Uwe Egly

Publication date: 5 September 2016

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

Full work available at URL: https://arxiv.org/abs/1604.06483

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Related Items

Unnamed Item ⋮ Lower bound techniques for QBF expansion ⋮ On Stronger Calculi for QBFs ⋮ Unnamed Item ⋮ Unnamed Item

Uses Software

• Quaffle

Cites Work

• A solver for QBFs in negation normal form
• The intractability of resolution
• A structure-preserving clause form translation
• Resolution for quantified Boolean formulas
• Quantified propositional calculus and a second-order theory for NC\(^{\text \textbf{1}}\)
• Unified QBF certification and its applications
• On Stronger Calculi for QBFs
• On Sequent Systems and Resolution for QBFs
• On Unification of QBF Resolution-Based Calculi
• QBF Resolution Systems and Their Proof Complexities
• Variable Dependencies and Q-Resolution
• Contributions to the Theory of Practical Quantified Boolean Formula Solving
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On Stronger Calculi for QBFs