A DPLL Algorithm with Literal Renaming Strategy

Abstract

Restricted on the proof of unsatisfiability of unsatisfiable formulas, a modified DPLL — RSMLS algorithm is presented. The new algorithm has a symmetry rule (Literal renaming ) and three simplified rule ((1,*)-Resolution, Subformula, and Multiple ). As an example, RSMLS algorithm is applied for the proof of unsatisfiability of pigeon-hole formula . We show with respect to RSMLS algorithm that has a refutation tree with at most O(n n n P 1 − n n P 1 − ) nodes.

2 Figures and Tables

Cite this paper

@inproceedings{Deng2000ADA, title={A DPLL Algorithm with Literal Renaming Strategy}, author={Tianyan Deng and Changyun Liu and Daoyun Xu}, year={2000} }