Width versus size in resolution proofs

Authors:
Alasdair Urquhart
Affiliations:
Departments of Philosophy and Computer Science, University of Toronto, Toronto, Ontario, Canada
Venue:
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Year:
2006

Citing 11
Cited 0

Hard examples for resolution

Journal of the ACM (JACM)
Many hard examples for resolution

Journal of the ACM (JACM)
Resolution proofs of generalized pigeonhole principles. (Note)

Theoretical Computer Science
Read-once branching programs, rectangular proofs of the pigeonhole principle and the transversal calculus

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Short proofs are narrow—resolution made simple

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Regular resolution lower bounds for the weak pigeonhole principle

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Resolution lower bounds for the weak pigeonhole principle

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Resolution and the Weak Pigeonhole Principle

CSL '97 Selected Papers from the11th International Workshop on Computer Science Logic
Resolution lower bounds for the weak functional pigeonhole principle

Theoretical Computer Science - Logic and complexity in computer science
Simplified and improved resolution lower bounds

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Resolution lower bounds for perfect matching principles

Journal of Computer and System Sciences - Special issue on computational complexity 2002

Quantified Score

Hi-index	0.00

Visualization

Abstract

The complexity of resolution refutations of contradictory sets of clauses in propositional logic has been investigated deeply over the last forty years, beginning with the groundbreaking paper of Tseitin [16], based on a talk given in a Leningrad seminar of 1966. A general theme that emerged gradually in the course of the intensive investigations of the last few decades has been that of basing size lower bounds on lower bounds on the width of refutations. Roughly speaking, it turns out that in many cases, the minimum size of a refutation is exponential in the minimum width.