@string{tocl="ACM Transactions on Computational Logic"}
@string{sep="September"}
@article{BeyersdorffBlinkhornMahajanPeitl22,
	author    = {Beyersdorff, Olaf and Blinkhorn, Joshua and Mahajan, Meena and Peitl, Tom\'{a}\v{s}},
	title     = {Hardness Characterisations and Size-Width Lower Bounds for {QBF} Resolution},
	year      = {2022},
	publisher = {Association for Computing Machinery},
	address   = {New York, NY, USA},
	issn      = {1529-3785},
	url       = {10.1145/3565286">https://doi.org/10.1145/3565286},
	doi       = {10.1145/3565286},
	abstract  = {We provide a tight characterisation of proof size in resolution for quantified Boolean formulas (QBF) via circuit complexity. Such a characterisation was previously obtained for a hierarchy of QBF Frege systems [16], but leaving open the most important case of QBF resolution. Different from the Frege case, our characterisation uses a new version of decision lists as its circuit model, which is stronger than the CNFs the system works with. Our decision list model is well suited to compute countermodels for QBFs. Our characterisation works for both Q-Resolution and QU-Resolution.Using our characterisation we obtain a size-width relation for QBF resolution in the spirit of the celebrated result for propositional resolution [4]. However, our result is not just a replication of the propositional relation – intriguingly ruled out for QBF in previous research [12] – but shows a different dependence between size, width, and quantifier complexity. An essential ingredient is an improved relation between the size and width of term decision lists; this may be of independent interest. We demonstrate that our new technique elegantly reproves known QBF hardness results and unifies previous lower-bound techniques in the QBF domain.},
	journal   = ToCL,
	month     = {sep},
	keywords  = {quantified Boolean formulas, size-width tradeoff, proof complexity}
}