On the Comparative Complexity of Resolution and the Connection Method

Authors:
Wolfgang Bibel
Affiliations:
-
Venue:
On the Comparative Complexity of Resolution and the Connection Method
Year:
1988

Citing 0
Cited 1

Path-focused duplication: a search procedure for general matings

AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

Quadratic proofs of the pigeonhole formulas are presented using the connection method proof techniques. For this class of formulas exponential lower bounds are known for the length-of-resolution refutations. This indicates a significant difference in the power of these two proof techniques. While short proofs of these formulas are known using extended resolution, this particular proof technique, in contrast to both the connection method and resolution, seems not suitable for the actual proof search.