On the Complexity of Resolution Procedures for Theorem Proving
| dc.contributor.author | Galil, Zvi | en_US |
| dc.date.accessioned | 2007-04-19T19:11:47Z | |
| dc.date.available | 2007-04-19T19:11:47Z | |
| dc.date.issued | 1974-12 | en_US |
| dc.description.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. | en_US |
| dc.format.extent | 2842422 bytes | |
| dc.format.extent | 1070861 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.citation | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR74-223 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1813/6062 | |
| dc.language.iso | en_US | en_US |
| dc.publisher | Cornell University | en_US |
| dc.subject | computer science | en_US |
| dc.subject | technical report | en_US |
| dc.title | On the Complexity of Resolution Procedures for Theorem Proving | en_US |
| dc.type | technical report | en_US |