Abstract

AbstractAn algorithm for satisfiability testing in the propositional calculus with a worst case running time that grows at a rate less than 2 (.25+e) L is described, where L can be either the length of theinput expression or the number of occurrences of literals (i.e., leaves) in it. This represents a new upper bound on the complexity of non-clausal satisfiability testing. The performance isachieved by using lemmas concerning assignments and pruning that preserve satisfiability, together with choosing a "good " variable upon which to recur. For expressions in conjunctivenormal form, it is shown that an upper bound is 2.128 L.

Citations

2172	The Design and Analysis of Computer Algorithms - Aho, Hopcroft, et al. - 1974
4	The complexity of resolution procedures for theorem proving in the propositon-al calculus - Galil - 1975
1	A computing procedure for quantification theory,'' JACM7(2 - Davis, Putnam - 1960