## The Complexity of Automated Reasoning (1989)

Citations: | 8 - 0 self |

### BibTeX

@MISC{Vellino89thecomplexity,

author = {André Vellino},

title = {The Complexity of Automated Reasoning},

year = {1989}

}

### Years of Citing Articles

### OpenURL

### Abstract

This thesis explores the relative complexity of proofs produced by the automatic theorem proving procedures of analytic tableaux, linear resolution, the connection method, tree resolution and the Davis-Putnam procedure. It is shown that tree resolution simulates the improved tableau procedure and that SL-resolution and the connection method are equivalent to restrictions of the improved tableau method. The theorem by Tseitin that the Davis-Putnam Procedure cannot be simulated by tree resolution is given an explicit and simplified proof. The hard examples for tree resolution are contradictions constructed from simple Tseitin graphs.