TY - GEN

T1 - α-Quasi-lock semantic resolution method for linguistic truth-valued lattice-valued propositional logic ℒ v(n×2)P(X)

AU - Zhong, Xiaomei

AU - Liu, Jun

AU - Chen, Shuwei

AU - Xu, Yang

PY - 2011

Y1 - 2011

N2 - On the basis of α-quasi-lock semantic resolution method in lattice-valued propositional logic (ℒ n×ℒ 2) P(X), α-quasi-lock semantic resolution in linguistic truth-valued lattice-valued propositional logic ℒ v(n×2)P(X) is studied in the present paper. Firstly, (c i , t)-quasi-lock semantic resolution for ℒ v(n×2)P(X) is equivalently transformed into that for lattice-valued propositional logic ℒ vnP(X). Secondly, similar equivalence between (c i , f)-quasi-lock semantic resolution for ℒ v(n×2)P(X) and that for ℒ vnP(X) is also established under certain conditions.

AB - On the basis of α-quasi-lock semantic resolution method in lattice-valued propositional logic (ℒ n×ℒ 2) P(X), α-quasi-lock semantic resolution in linguistic truth-valued lattice-valued propositional logic ℒ v(n×2)P(X) is studied in the present paper. Firstly, (c i , t)-quasi-lock semantic resolution for ℒ v(n×2)P(X) is equivalently transformed into that for lattice-valued propositional logic ℒ vnP(X). Secondly, similar equivalence between (c i , f)-quasi-lock semantic resolution for ℒ v(n×2)P(X) and that for ℒ vnP(X) is also established under certain conditions.

KW - α-Quasi-lock semantic resolution method

KW - Linguistic truth-valued lattice implication algebra

KW - Linguistic truth-valued lattice-valued propositional logic

KW - Resolution-based automated reasoning

UR - http://www.scopus.com/inward/record.url?scp=84555204776&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-25664-6_20

DO - 10.1007/978-3-642-25664-6_20

M3 - Conference contribution

AN - SCOPUS:84555204776

SN - 9783642256639

T3 - Advances in Intelligent and Soft Computing

SP - 159

EP - 169

BT - Foundations of Intelligent Systems

A2 - Wang, Yinglin

A2 - Li, Tianrui

ER -