![Sample our Computer Science journals, sign in here to start your access, latest two full volumes FREE to you for 14 days]({"type":"image" , "src" : "/sda/5928/TOC-Subject-Sample-2021-Computer-Science.jpg"})
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 (Ln× L2)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 α-generalized semantic resolution for linguistic truth-valued lattice-valued propositional logic LV(n×2)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.