Publication
Theoretical Computer Science
Paper

On the complexity of regular resolution and the Davis-Putnam procedure

View publication

Abstract

For infinitely many n > 0 we construct contradictory formulas αn in conjunctive form with n literals such that every regular proof tree which proves the contradiction must contain 2cn distinct clauses for some c > 0. This implies a 2cn lower bound for the number of distinct clauses which are generated by the Davis-Putnam procedure applied to αn using any order of variable elimination. © 1977.

Date

01 Jan 1977

Publication

Theoretical Computer Science

Authors

Topics

Share