Size space tradeoffs for resolution

Authors:
Eli Ben-Sasson
Affiliations:
Harvard University, Cambridge, MA
Venue:
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Year:
2002

Citing 18
Cited 9

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
Using the Groebner basis algorithm to find proofs of unsatisfiability

STOC '96 Proceedings of the twenty-eighth 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
A Computing Procedure for Quantification Theory

Journal of the ACM (JACM)
A Machine-Oriented Logic Based on the Resolution Principle

Journal of the ACM (JACM)
On Time Versus Space

Journal of the ACM (JACM)
Space complexity in propositional calculus

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
A machine program for theorem-proving

Communications of the ACM
Regular resolution lower bounds for the weak pigeonhole principle

STOC '01 Proceedings of the thirty-third 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
Upper and lower bounds on time-space tradeoffs

STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Space Complexity of Random Formulae in Resolution

CCC '01 Proceedings of the 16th Annual Conference on Computational Complexity
Resolution Lower Bounds for the Weak Pigeonhole Principle

CCC '02 Proceedings of the 17th IEEE Annual Conference on Computational Complexity
Simplified and improved resolution lower bounds

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Resolution is Not Automatizable Unless W[P] is Tractable

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Space bounds for resolution

STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science

On the Complexity of Resolution with Bounded Conjunctions

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
A combinatorial characterization of treelike resolution space

Information Processing Letters
On the complexity of resolution with bounded conjunctions

Theoretical Computer Science
Narrow proofs may be spacious: separating space and width in resolution

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Towards an optimal separation of space and length in resolution

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Regular and general resolution: an improved separation

SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
The Depth of Resolution Proofs

Studia Logica
A Near-Optimal Separation of Regular and General Resolution

SIAM Journal on Computing
Game characterizations and the PSPACE-completeness of tree resolution space

CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate tradeoffs of various important complexity measures such as size, space and width. We show examples of CNF formulas that have optimal proofs with respect to any one of these parameters, but optimizing one parameter must cost an increase in the other. These results, the first of their kind, have implications on the efficiency (or rather, inefficiency) of some commonly used SAT solving heuristics.Our proof relies on a novel and somewhat surprising connection of the variable space of a proof, to the black white pebbling measure of an underlying graph.