Regular and general resolution: an improved separation

Authors:
Alasdair Urquhart
Affiliations:
Department of Computer Science, University of Toronto, Toronto, Ontario, Canada
Venue:
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Year:
2008

Citing 9
Cited 3

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
Tail bounds for occupancy and the satisfiability threshold conjecture

Random Structures & Algorithms
A machine program for theorem-proving

Communications of the ACM
An exponential separation between regular and general resolution

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Size space tradeoffs for resolution

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Optimality of size-width tradeoffs for resolution

Computational Complexity
Near Optimal Separation Of Tree-Like And General Resolution

Combinatorica

Clause learning can effectively P-simulate general propositional resolution

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
The Depth of Resolution Proofs

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

SIAM Journal on Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper gives an improved separation between regular and unrestricted resolution. The main result is that there is a sequence Π1, Π2, ..., Πi, ... of sets of clauses for which the minimum regular resolution refutation of Πi has size 2Ω(Ri/(log Ri)7), where Ri is the minimum size of an unrestricted resolution refutation of Πi. This improves earlier lower bounds for which the separations proved were of the form 2Ω(3√R) and 2Ω(4√R/(log R)3).