Non-Automatizability of Bounded-Depth Frege Proofs

Authors:
Maria Luisa Bonet;Carlos Domingo;Ricard Gavalda;Alexis Maciel;Toniann Pitassi
Affiliations:
-;-;-;-;-
Venue:
COCO '99 Proceedings of the Fourteenth Annual IEEE Conference on Computational Complexity
Year:
1999

Citing 0
Cited 6

On the Automatizability of Resolution and Related Propositional Proof Systems

CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Monotone Proofs of the Pigeon Hole Principle

ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
A Study of Proof Search Algorithms for Resolution and Polynomial Calculus

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Optimality of size-width tradeoffs for resolution

Computational Complexity
Upper and Lower Bounds on the Complexity of Generalised Resolution and Generalised Constraint Satisfaction Problems

Annals of Mathematics and Artificial Intelligence
On the automatizability of resolution and related propositional proof systems

Information and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we show how to extend the argument due to Bonet, Pitassi and Raz to show that bounded-depth Frege proofs do not have feasible interpolation, assuming that factoring of Blum integers or computing the Diffie-Hellman function is sufficiently hard. It follows as a corollary that bounded-depth Frege is not automatizable; in other words, there is no deterministic polynomial-time algorithm that will output a short proof if one exists. A notable feature of our argument is its simplicity.