DeepAI AI Chat
Log In Sign Up

QRAT Polynomially Simulates Merge Resolution

07/20/2021
by   Sravanthi Chede, et al.
Indian Institute of Technology Ropar
0

Merge Resolution (MRes [Beyersdorff et al. J. Autom. Reason.'2021] ) is a refutational proof system for quantified Boolean formulas (QBF). Each line of MRes consists of clauses with only existential literals, together with information of countermodels stored as merge maps. As a result, MRes has strategy extraction by design. The QRAT [Heule et al. J. Autom. Reason.'2017] proof system was designed to capture QBF preprocessing. QRAT can simulate both the expansion-based proof system ∀Exp+Res and CDCL-based QBF proof system LD-Q-Res. A family of false QBFs called SquaredEquality formulas were introduced in [Beyersdorff et al. J. Autom. Reason.'2021] and shown to be easy for MRes but need exponential size proofs in Q-Res, QU-Res, CP+∀red, ∀Exp+Res, IR-calc and reductionless LD-Q-Res. As a result none of these systems can simulate MRes. In this paper, we show a short QRAT refutation of the SquaredEquality formulas. We further show that QRAT strictly p-simulates MRes. Besides highlighting the power of QRAT system, this work also presents the first simulation result for MRes.

READ FULL TEXT
12/12/2020

Hard QBFs for Merge Resolution

We prove the first proof size lower bounds for the proof system Merge Re...
12/21/2021

Extending Merge Resolution to a Family of Proof Systems

Merge Resolution (MRes [Beyersdorff et al. J. Autom. Reason.'2021]) is a...
04/19/2023

Limits of CDCL Learning via Merge Resolution

In their seminal work, Atserias et al. and independently Pipatsrisawat a...
05/26/2022

QBF Merge Resolution is powerful but unnatural

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

Towards Uniform Certification in QBF

We pioneer a new technique that allows us to prove a multitude of previo...
08/02/2019

On the modes of convergence of Stochastic Optimistic Mirror Descent (OMD) for saddle point problems

In this article, we study the convergence of Mirror Descent (MD) and Opt...
06/07/2020

On the Complexity of Branching Proofs

We consider the task of proving integer infeasibility of a bounded conve...