Level-ordered \(Q\)-resolution and tree-like \(Q\)-resolution are incomparable
type: Item
instance of: scholarly article
title: Level-ordered \(Q\)-resolution and tree-like \(Q\)-resolution are incomparable
zbMATH Open document ID: 1348.03056
author: Meena Mahajan
author: Anil K. Shukla
published in: Information Processing Letters
publication date: 2016-01-05T00:00:00Z
Mathematics Subject Classification ID: 03F20
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 6526415
zbMATH Keywords: computational complexity
zbMATH Keywords: proof complexity
zbMATH Keywords: quantified Boolean formulas (QBF)
zbMATH Keywords: resolution
describes a project that uses: RAReQS
MaRDI profile type: Publication
full work available at URL: j.ipl.2015.11.017
OpenAlex ID: W2186016250
cites work: Resolution for quantified Boolean formulas
cites work: On Propositional QBF Expansions and Q-Resolution
cites work: Solving QBF with Counterexample Guided Refinement
cites work: An algorithm to evaluate quantified Boolean formulae and its experimental evaluation
cites work: Expansion-based QBF solving versus Q-resolution
cites work: Q2954985
cites work: On the relative complexity of resolution refinements and cutting planes proof systems
cites work: The complexity of resolution refinements
DOI: 10.1016/J.IPL.2015.11.017
description: scientific article; zbMATH DE number 6526415