Uncertain Reasoning Method Based On Generalized Linguistic Truth-Valued Lattice-Valued Logic

With the development of artificial intelligence,our lives are becoming more and more intelligent.There will be a lot of uncertain information in objective evaluation and reasoning in daily life.Humans are accustomed to using linguistic value when expressing uncertain information.The linguistic truth-valued lattice implication algebra is proposed which can not only deal with the problem of linguistic-valued information that is both comparable and incomparable,but also using linguistic value to infer can reduce information loss and improve information processing efficiency.Aiming at the problem that humans discover that the negation of the same linguistic values will have different negative results according to different thinking,this paper that is based on the linguistic truth-valued logic system of linguistic truthvalued lattice implication algebra,the uncertain reasoning method of the generalized linguistic truth-valued lattice logic system and the uncertain reasoning method based on the generalized linguistic truth-valued predicate logic system are proposed.The main results of this paper are shown as follow:Linguistic truth-valued logic system which is based on the linguistic truth-valued lattice implication algebraic,combined with the negation of linguistic value,we construct a generalized linguistic truth-valued lattice-valued logic system,and discusses the negative operators of proposition in the generalized linguistic truth-valued lattice-valued logic system.Then negative operators are divided into strong negative operators,full negative operators and weak negative operators.The relation properties of negative operators are studied.Based on the variety of negative operators,the aggregation operations between different negative operators are proposed.Combining the filter-based resolution automatic reasoning method of linguistic truth-valued,a resolution automatic reasoning method of generalized linguistic truth-valued based on filter-based is proposed.This method can effectively solve the resolution problem in the case of different negative operators.This method is applied to the examples to illustrate the rationality and effectiveness.In order to solve the limitation of existential quantifier and universal quantifiers in classical predicate logic.Based on the linguistic truth-valued predicate logic system,a generalized linguistic truth-valued predicate logic system is constructed,in which linguistic valued quantifiers and their related properties are studied.A method of transforming the generalized linguistic truth-valued predicate logic formula into Skolem normal form is given in generalized linguistic truth-valued predicate logic system is studied.This paper discusses the resolution principle of the generalized linguistic truth-valued predicate logic system.Combining the classical binary resolution method,a method for resolution automatic reasoning of generalized linguistic truth-valued predicate logic system is proposed.This method can effectively solve the resolution problem in the case of linguistic value quantifiers.This method will be applied to the examples to illustrate the rationality and effectiveness.