A Kind of Resolution Method of Linguistic Truth-Valued Propositional Logic Based on LIA

In the present paper, based on lattice implication algebra, a kind of linguistic truth-valued propositional logic is constructed with some logic properties regarding reasoning being provided which can express both the comparable and incomparable truth values. Secondly, the satisfiability problem is discussed. J-true, J-false of a formula, J-similar literals and J-complementary literals are proposed based on a filter J of L. Finally, Based on the degree of complementary and degree of similar J-resolution method in the filter of the linguistic truth-valued propositional logic is introduced.