Advertisement
Published in:
2012 | OriginalPaper | Chapter
α-Quasi-Lock Semantic Resolution Method for Linguistic Truth-Valued Lattice-Valued Propositional Logic P(x)
Authors : Xiaomei Zhong, Jun Liu, Shuwei Chen, Yang Xu
Published in: Foundations of Intelligent Systems
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
On the basis of
α
-quasi-lock semantic resolution method in lattice-valued propositional logic (
$\mathcal{L}_{n}\times\mathcal{L}_{2}$
)P(X),
α
-quasi-lock semantic resolution in linguistic truth-valued lattice-valued propositional logic
$\mathcal{L}_{V(n\times2)}$
P(X) is studied in the present paper. Firstly, (
c
i
,
t
)-quasi-lock semantic resolution for
$\mathcal{L}_{V(n\times2)}$
P(X) is equivalently transformed into that for lattice-valued propositional logic
$\mathcal{L}_{Vn}$
P(X). Secondly, similar equivalence between (
c
i
,
f
)-quasi-lock semantic resolution for
$\mathcal{L}_{V(n\times2)}$
P(X) and that for
$\mathcal{L}_{Vn}$
P(X) is also established under certain conditions.