A new automated reasoning method based on path searching is put forward. This method adopts
pre-processing and dynamic deletion strategies so as to convertmulti-path searching into one-path searching.
It can be used to validate the unsatisfiability of lattice-valued propositional logic formulae quickly. In
addition, the soundness and completeness of the method are proved.