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

Xiaomei Zhong; Jun Liu; Shuwei Chen; Yang Xu

doi:10.1007/978-3-642-25664-6_20

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

Xiaomei Zhong, Jun Liu, Shuwei Chen, Yang Xu

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

2 Citations (Scopus)

Abstract

On the basis of α-quasi-lock semantic resolution method in lattice-valued propositional logic (ℒ _n×ℒ ₂) 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.

Original language	English
Title of host publication	Foundations of Intelligent Systems
Subtitle of host publication	Proceedings of the Sixth International Conference on Intelligent Systems and Knowledge Engineering, Shanghai, China, Dec 2011 (ISKE2011)
Editors	Yinglin Wang, Tianrui Li
Pages	159-169
Number of pages	11
DOIs	https://doi.org/10.1007/978-3-642-25664-6_20
Publication status	Published (in print/issue) - 2011

Publication series

Name	Advances in Intelligent and Soft Computing
Volume	122
ISSN (Print)	1867-5662

Keywords

α-Quasi-lock semantic resolution method
Linguistic truth-valued lattice implication algebra
Linguistic truth-valued lattice-valued propositional logic
Resolution-based automated reasoning

Access to Document

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

Cite this

Zhong, X., Liu, J., Chen, S., & Xu, Y. (2011). α-Quasi-lock semantic resolution method for linguistic truth-valued lattice-valued propositional logic ℒ _v(n×2)P(X). In Y. Wang, & T. Li (Eds.), Foundations of Intelligent Systems: Proceedings of the Sixth International Conference on Intelligent Systems and Knowledge Engineering, Shanghai, China, Dec 2011 (ISKE2011) (pp. 159-169). (Advances in Intelligent and Soft Computing; Vol. 122). https://doi.org/10.1007/978-3-642-25664-6_20

Zhong, Xiaomei ; Liu, Jun ; Chen, Shuwei et al. / α-Quasi-lock semantic resolution method for linguistic truth-valued lattice-valued propositional logic ℒ _v(n×2)P(X). Foundations of Intelligent Systems: Proceedings of the Sixth International Conference on Intelligent Systems and Knowledge Engineering, Shanghai, China, Dec 2011 (ISKE2011). editor / Yinglin Wang ; Tianrui Li. 2011. pp. 159-169 (Advances in Intelligent and Soft Computing).

@inproceedings{7a290c09e8eb40d2bc379a0665f4f76d,

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

abstract = "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.",

keywords = "α-Quasi-lock semantic resolution method, Linguistic truth-valued lattice implication algebra, Linguistic truth-valued lattice-valued propositional logic, Resolution-based automated reasoning",

author = "Xiaomei Zhong and Jun Liu and Shuwei Chen and Yang Xu",

year = "2011",

doi = "10.1007/978-3-642-25664-6_20",

language = "English",

isbn = "9783642256639",

series = "Advances in Intelligent and Soft Computing",

pages = "159--169",

editor = "Yinglin Wang and Tianrui Li",

booktitle = "Foundations of Intelligent Systems",

}

Zhong, X, Liu, J, Chen, S & Xu, Y 2011, α-Quasi-lock semantic resolution method for linguistic truth-valued lattice-valued propositional logic ℒ _v(n×2)P(X). in Y Wang & T Li (eds), Foundations of Intelligent Systems: Proceedings of the Sixth International Conference on Intelligent Systems and Knowledge Engineering, Shanghai, China, Dec 2011 (ISKE2011). Advances in Intelligent and Soft Computing, vol. 122, pp. 159-169. https://doi.org/10.1007/978-3-642-25664-6_20

α-Quasi-lock semantic resolution method for linguistic truth-valued lattice-valued propositional logic ℒ _v(n×2)P(X). / Zhong, Xiaomei; Liu, Jun; Chen, Shuwei et al.
Foundations of Intelligent Systems: Proceedings of the Sixth International Conference on Intelligent Systems and Knowledge Engineering, Shanghai, China, Dec 2011 (ISKE2011). ed. / Yinglin Wang; Tianrui Li. 2011. p. 159-169 (Advances in Intelligent and Soft Computing; Vol. 122).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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 -

Zhong X, Liu J, Chen S, Xu Y. α-Quasi-lock semantic resolution method for linguistic truth-valued lattice-valued propositional logic ℒ _v(n×2)P(X). In Wang Y, Li T, editors, Foundations of Intelligent Systems: Proceedings of the Sixth International Conference on Intelligent Systems and Knowledge Engineering, Shanghai, China, Dec 2011 (ISKE2011). 2011. p. 159-169. (Advances in Intelligent and Soft Computing). doi: 10.1007/978-3-642-25664-6_20