α-Generalized Semantic Resolution Method in Linguistic Truth-valued Propositional Logic P(X)

Abstract

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 ()P(X) is equivalently transformed into that for lattice-valued propositional logic P(X)( ∊ {1,2…,}). A similar conclusion is obtained between the α-generalized semantic resolution for linguistic truth-valued lattice-valued propositional logic P(X) and that for lattice-valued propositional logic P(X)( ∊ {1,2,…,}). Secondly, the generalized semantic resolution for lattice-valued propositional logic P(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.

Keywords

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