An elimination resolution based on propositional logic

In order to improve the reasoning efficiency of the resolution principle in propositional logic, in the purpose of reducing the size of clause set and eliminating the number of literal in clause set as soon as possible. In this paper, it presents an elimination resolution method by calculating the number of complementary pairs to pick out resolution literal. This paper proves the completeness of this method for base clause set. It provides a certain basis for automatic reasoning based on propositional logic.