A unified algorithm for finding -IESFs in linguistic truth-valued lattice-valued propositional logic

作者：He Xingxing^*; Xu Yang; Liu Jun; Chen Shuwei

来源：Soft Computing, 2014, 18(11): 2135-2147.

DOI：10.1007/s00500-013-1188-2

• Linguistic truth-valued lattice-valued propositional logic
• Lattice implication algebras
• alpha-Resolution
• Indecomposable extremely simple form (IESF)

As a symbolic approach for computing with words, linguistic truth-valued lattice-valued propositional logic can represent and handle both imprecise and incomparable linguistic value-based information. Indecomposable extremely simple form (IESF) is a basic concept of -resolution automated reasoning in lattice-valued logic based in lattice implication algebra (LIA). In this paper we establish a unified method for finding the structure of -IESF in . Firstly, some operational properties of logical formulae in are studied, and some rules are obtained for judging whether a given logical formula is a -IESF, which are used to contrive an algorithm for finding -IESF in . Then, all the results are extended into . Finally, a unified algorithm for finding all -IESFs in is proposed. This work provides theoretical foundations and algorithms for -resolution automated reasoning in linguistic truth-valued lattice-valued logic based in linguistic truth-valued LIAs and formal tools for symbolic natural language processing.

• 出版日期2014-11
• 单位西南交通大学