@MISC{_1a, author = {}, title = {1 A Satisfiability Tester for Non-Clausal Propositional Calculus}, year = {} }

Share

OpenURL

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.