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

DOI

10.1080/18756891.2013.857895How to use a DOI?

Keywords

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

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.

Copyright

© 2017, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - JOUR
AU  - Jiafeng Zhang
AU  - Yang Xu
AU  - Xingxing He
PY  - 2014
DA  - 2014/02/03
TI  - α-Generalized Semantic Resolution Method in Linguistic Truth-valued Propositional Logic P(X)
JO  - International Journal of Computational Intelligence Systems
SP  - 160
EP  - 171
VL  - 7
IS  - 1
SN  - 1875-6883
UR  - https://doi.org/10.1080/18756891.2013.857895
DO  - 10.1080/18756891.2013.857895
ID  - Zhang2014
ER  -