An exponential separation between regular and general resolution

Authors:
Michael Alekhnovich;Jan Johannsen;Toniann Pitassi;Alasdair Urquhart
Affiliations:
Massachusetts Institute of Technology, Cambridge, MA;Ludwig-Maximilians-Universität, München, Germany;University of Toronto, Toronto, ON, Canada;University of Toronto, Toronto, ON, Canada
Venue:
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Year:
2002

Citing 8
Cited 15

Short proofs for tricky formulas

Acta Informatica
A DNF without regular shortest consensus path

SIAM Journal on Computing
Regular resolution versus unrestricted resolution

SIAM Journal on Computing
Bounded arithmetic, propositional logic, and complexity theory

Bounded arithmetic, propositional logic, and complexity theory
A machine program for theorem-proving

Communications of the ACM
On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systems

SIAM Journal on Computing
Separation of the monotone NC hierarchy

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
A Study of Proof Search Algorithms for Resolution and Polynomial Calculus

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of 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
Eulogy: Michael (Misha) Alekhnovich 1978-2006

ACM SIGACT News
Note: The NP-hardness of finding a directed acyclic graph for regular resolution

Theoretical Computer Science
Limitations of restricted branching in clause learning

Constraints
Clause learning can effectively P-simulate general propositional resolution

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Towards understanding and harnessing the potential of clause learning

Journal of Artificial Intelligence Research
Understanding the power of clause learning

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
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
Pool resolution and its relation to regular resolution and DPLL with clause learning

LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Input distance and lower bounds for propositional resolution proof length

SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Exact thresholds for DPLL on random XOR-SAT and NP-complete extensions of XOR-SAT

Theoretical Computer Science
Lower bounds for width-restricted clause learning on small width formulas

SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
Preliminary report on input cover number as a metric for propositional resolution proofs

SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Time-space tradeoffs in resolution: superpolynomial lower bounds for superlinear space

STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Two distinct proofs of an exponential separation between regular resolution and unrestricted resolution are given. The previous best known separation between these systems was quasi-polynomial.