Resolution Method in Linguistic Propositional Logic

In the present paper, the resolution method for a linguistic propositional logic with truth value in a logical algebra - refined hedge algebra, is focused. The preliminaries of refined hedge algebra are given first. Then the syntax and semantic of linguistic propositional are defined. Finally, a resolution method which based on resolution principle in two-valued logic is established. Accordingly, the research in this paper will be helpful support for the application of intelligent reasoning system based on linguistic-valued logic which includes incomparable information.