a- Generalized Semantic Resolution Method in Linguistic Truth- valued Propositional Logic L V ( n epsilon 2) P(

作者：Zhang Jiafeng^*; Xu Yang; He Xingxing

来源：International Journal of Computational Intelligence Systems, 2014, 7(1): 160-171.

DOI：10.1080/18756891.2013.857895

• Automated reasoning
• Resolution principle
• Semantic resolution method
• Lattice-valued logic
• Linguistic truth-valued lattice implication algebras

This paper is focused on -generalized semantic resolution automated reasoning method in linguistic truth-valued lattice-valued propositional logic. Concretely, -generalized semantic resolution for lattice-valued propositional logic (L(n)x L-2)P(X) is equivalently transformed into that for lattice-valued propositional logic LnP(X)(i {1,2...,n}). A similar conclusion is obtained between the alpha-generalized semantic resolution for linguistic truth-valued lattice-valued propositional logic LV(nx2)P(X) and that for lattice-valued propositional logic LV(n)P(X)(i {1,2,...,n}). Secondly, the generalized semantic resolution for lattice-valued propositional logic LnP(X) based on a chain-type truth-valued field is investigated and its soundness and weak completeness are given. The Presented work provides some foundations for resolution-based automated reasoning in linguistic truth-valued lattice-valued logic based on lattice implication algebra.

• 出版日期2014-1-2
• 单位贵州工程应用技术学院; 西南交通大学