Failure of Feasible Disjunction Property for k-DNF Resolution and NP-hardness of Automating It

03/20/2020
by   Michal Garlík, et al.
0

We show that for every integer k ≥ 2, the Res(k) propositional proof system does not have the weak feasible disjunction property. Next, we generalize a recent result of Atserias and Müller [FOCS, 2019] to Res(k). We show that if NP is not included in P (resp. QP, SUBEXP) then for every integer k ≥ 1, Res(k) is not automatable in polynomial (resp. quasi-polynomial, subexponential) time.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/05/2019

Automating Resolution is NP-Hard

We show that the problem of finding a Resolution refutation that is at m...
research
02/18/2020

Fuzzy Simultaneous Congruences

We introduce a very natural generalization of the well-known problem of ...
research
09/07/2020

A Simpler NP-Hardness Proof for Familial Graph Compression

This document presents a simpler proof showcasing the NP-hardness of Fam...
research
12/23/2022

A Closer Look at Some Recent Proof Compression-Related Claims

Gordeev and Haeusler [GH19] claim that each tautology ρ of minimal propo...
research
07/16/2023

On the Hardness of PosSLP

The problem PosSLP involves determining whether an integer computed by a...
research
04/06/2020

A limitation on the KPT interpolation

We prove a limitation on a variant of the KPT theorem proposed for propo...
research
03/19/2023

A proof complexity conjecture and the Incompleteness theorem

Given a sound first-order p-time theory T capable of formalizing syntax ...

Please sign up or login with your details

Forgot password? Click here to reset