/spl alpha/-automated reasoning method based on regular generalized conjunctive normal form of LP(X)

We focus on automated reasoning based on lattice-valued propositional logic LP(X). A new method of automated reasoning is given, and the soundness and completeness theorems of this method are also proved.