Level-ordered \(Q\)-resolution and tree-like \(Q\)-resolution are incomparable

DOI10.1016/j.ipl.2015.11.017zbMath1348.03056OpenAlexW2186016250MaRDI QIDQ903199

Meena Mahajan, Anil K. Shukla

Publication date: 5 January 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2015.11.017

zbMATH Keywords

computational complexityresolutionproof complexityquantified Boolean formulas (QBF)

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity of proofs (03F20)

Related Items (1)

On Q-Resolution and CDCL QBF Solving

Uses Software

• RAReQS

Cites Work

• Unnamed Item
• An algorithm to evaluate quantified Boolean formulae and its experimental evaluation
• Resolution for quantified Boolean formulas
• Expansion-based QBF solving versus Q-resolution
• On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systems
• Solving QBF with Counterexample Guided Refinement
• On Propositional QBF Expansions and Q-Resolution
• The complexity of resolution refinements

This page was built for publication: Level-ordered \(Q\)-resolution and tree-like \(Q\)-resolution are incomparable