On the Complexity of Resolution Procedures for Theorem Proving

Authors:
Zvi Galil
Affiliations:
-
Venue:
On the Complexity of Resolution Procedures for Theorem Proving
Year:
1974

Citing 0
Cited 1

On the validity and complexity of bounded resolution

STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study several procedures for theorem proving based on the resolution principle. We consider (1) Davis Putnam procedure; (2) regular resolution; (3) unrestricted resolution; (4) resolution with extension; and (5) several versions of bounded resolution. The powers of these procedures are compared. Exponential lower bounds are proved for the run-time of some of them.