α-Generalized lock resolution method in linguistic truth-valued lattice-valued logic

DOI

10.1080/18756891.2012.747665How to use a DOI?

Keywords

Non-clausal resolution, α-Generalized lock resolution, α-Generalized linear semi-lock resolution, Linguistic truth-valued lattice-valued logic, Lattice implication algebras

Abstract

This paper focuses on effcient non-clausal resolution-based automated reasoning methods and algorithms for a lattice-ordered linguistic truth-valued logic, which corresponds to extensions of α-lock resolution. Firstly, α-generalized lock resolution is proposed for lattice-valued propositional logic and first order logic, respectively, along with their concepts, soundness and completeness. Then, α-generalized lock resolution for first order linguistic truth-valued lattice-valued logic F(X) is equivalently transformed into that for propositional logic P(X), which can greatly reduce the complexity of the resolution procedure. Finally, α-generalized linear semi-lock resolution is discussed, and its general algorithm is also contrived. This work provides more efficient and natural resolution automated reasoning scheme in linguistic truth-valued logic based on lattice implication algebra with the aim at establishing formal tools for symbolic natural language processing.

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  - Xingxing He
AU  - Yang Xu
AU  - Jun Liu
AU  - Shuwei Chen
PY  - 2012
DA  - 2012/11/01
TI  - α-Generalized lock resolution method in linguistic truth-valued lattice-valued logic
JO  - International Journal of Computational Intelligence Systems
SP  - 1120
EP  - 1134
VL  - 5
IS  - 6
SN  - 1875-6883
UR  - https://doi.org/10.1080/18756891.2012.747665
DO  - 10.1080/18756891.2012.747665
ID  - He2012
ER  -