Limits of CDCL Learning via Merge Resolution

04/19/2023
by   Marc Vinyals, et al.
0

In their seminal work, Atserias et al. and independently Pipatsrisawat and Darwiche in 2009 showed that CDCL solvers can simulate resolution proofs with polynomial overhead. However, previous work does not address the tightness of the simulation, i.e., the question of how large this overhead needs to be. In this paper, we address this question by focusing on an important property of proofs generated by CDCL solvers that employ standard learning schemes, namely that the derivation of a learned clause has at least one inference where a literal appears in both premises (aka, a merge literal). Specifically, we show that proofs of this kind can simulate resolution proofs with at most a linear overhead, but there also exist formulas where such overhead is necessary or, more precisely, that there exist formulas with resolution proofs of linear length that require quadratic CDCL proofs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/20/2021

QRAT Polynomially Simulates Merge Resolution

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

Hard QBFs for Merge Resolution

We prove the first proof size lower bounds for the proof system Merge Re...
research
02/14/2018

Circular (Yet Sound) Proofs

We introduce a new way of composing proofs in rule-based proof systems t...
research
01/13/2021

Resolution with Symmetry Rule applied to Linear Equations

This paper considers the length of resolution proofs when using Krishnam...
research
12/21/2021

Extending Merge Resolution to a Family of Proof Systems

Merge Resolution (MRes [Beyersdorff et al. J. Autom. Reason.'2021]) is a...
research
06/07/2022

Multi-qubit doilies: enumeration for all ranks and classification for ranks four and five

For N ≥ 2, an N-qubit doily is a doily living in the N-qubit symplectic ...
research
10/05/2020

Are Two Binary Operators Necessary to Finitely Axiomatise Parallel Composition?

Bergstra and Klop have shown that bisimilarity has a finite equational a...

Please sign up or login with your details

Forgot password? Click here to reset