The Depth of Resolution Proofs |
| |
| Authors: | Alasdair Urquhart |
| |
| Affiliation: | 1. Department of Computer Science, University of Toronto, 10 King??s College Road, Toronto, Ontario, Canada
|
| |
| Abstract: | This paper investigates the depth of resolution proofs, that is to say, the length of the longest path in the proof from an input clause to the conclusion. An abstract characterization of the measure is given, as well as a discussion of its relation to other measures of space complexity for resolution proofs |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
