Log In Sign Up

Towards Uniform Certification in QBF

by   Leroy Chew, et al.

We pioneer a new technique that allows us to prove a multitude of previously open simulations in QBF proof complexity. In particular, we show that extended QBF Frege p-simulates clausal proof systems such as IR-Calculus, IRM-Calculus, Long-Distance Q-Resolution, and Merge Resolution. These results are obtained by taking a technique of Beyersdorff et al. (JACM 2020) that turns strategy extraction into simulation and combining it with new local strategy extraction arguments. This approach leads to simulations that are carried out mainly in propositional logic, with minimal use of the QBF rules. Our proofs therefore provide a new, largely propositional interpretation of the simulated systems. We argue that these results strengthen the case for uniform certification in QBF solving, since many QBF proof systems now fall into place underneath extended QBF Frege.


page 1

page 2

page 3

page 4


Hard QBFs for Merge Resolution

We prove the first proof size lower bounds for the proof system Merge Re...

On proof theory in computational complexity: overview

In [GH1] and [GH2] (see also [GH3]) we presented full proof of the equal...

Generating Schemata of Resolution Proofs

Two distinct algorithms are presented to extract (schemata of) resolutio...

QRAT Polynomially Simulates Merge Resolution

Merge Resolution (MRes [Beyersdorff et al. J. Autom. Reason.'2021] ) is ...

QBF Merge Resolution is powerful but unnatural

The Merge Resolution proof system (M-Res) for QBFs, proposed by Beyersdo...

On Expansion and Resolution in CEGAR Based QBF Solving

A quantified Boolean formula (QBF) is a propositional formula extended w...

Kernelization, Proof Complexity and Social Choice

We display an application of the notions of kernelization and data reduc...