The complexity of resolution procedures for theorem proving in the propositional calculus.

Authors:
Zvi Galil
Affiliations:
-
Venue:
The complexity of resolution procedures for theorem proving in the propositional calculus.
Year:
1975

Citing 0
Cited 2

Examples of hard tautologies in the propositional calculus

STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Pebblings, edgings, and equational logic

STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract