Resolution principle based on finite chain lattice-valued proposition logic FCLP(X)

Abstract

In the present paper, resolution-based automated reasoning theory and algorithm in a finite chain lattice-valued proposition logic are focused. Concretely, the resolution principle, which is based on a finite chain lattice-valued propositional logic FCLP(X) is investigated. And soundness theorem and completeness theorem of this resolution principle are also proved. In order to realize resolution, the concrete algorithm of resolution is discussed. It is hoped that this research will make forward theoretical research of automated reasoning based on lattice-valued logic.