eCommons

 

On the Complexity of Resolution Procedures for Theorem Proving

Other Titles

Author(s)

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.

Journal / Series

Volume & Issue

Description

Sponsorship

Date Issued

1974-12

Publisher

Cornell University

Keywords

computer science; technical report

Location

Effective Date

Expiration Date

Sector

Employer

Union

Union Local

NAICS

Number of Workers

Committee Chair

Committee Co-Chair

Committee Member

Degree Discipline

Degree Name

Degree Level

Related Version

Related DOI

Related To

Related Part

Based on Related Item

Has Other Format(s)

Part of Related Item

Related To

Related Publication(s)

Link(s) to Related Publication(s)

References

Link(s) to Reference(s)

Previously Published As

http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR74-223

Government Document

ISBN

ISMN

ISSN

Other Identifiers

Rights

Rights URI

Types

technical report

Accessibility Feature

Accessibility Hazard

Accessibility Summary

Link(s) to Catalog Record