Paper Info
Title
On compatibilities of α-lock resolution method in linguistic truth-valued lattice-valued logic
Abstract
The paper focuses on the efficient resolution-based automated reasoning theory, approach and algorithm for a lattice-ordered linguistic truth-valued logic. Firstly two hybrid resolution methods in linguistic truth-valued lattice-valued logic are proposed by combining α-lock resolution with generalized deleting strategy and α-linear resolution. α-Lock resolution for first-order linguistic truth-valued lattice-valued logic $$\fancyscript{L}_{V(n \times 2)}F(X)$$ is equivalently transformed into that for propositional logic $$L_{n}P(X)$$ which reduce much the complexity of the resolution procedure. Then the compatibilities of α-lock resolution with generalized deleting strategy and α-linear resolution are discussed. We finally contrive an algorithm for α-linear semi-lock resolution and some examples are provided to illustrate the proposed theory and algorithm. This work provides effective support for automated reasoning scheme in linguistic truth-valued logic based on lattice-valued algebra with the aim at establishing formal tools for symbolic natural language processing.
Year
DOI
Venue
2012
10.1007/s00500-011-0779-z
Soft Comput.
Keywords
Field
DocType
Linguistic truth-valued lattice-valued logic,α-Lock resolution,Compatibilities,Generalized deleting strategy,α-Linear resolution,α-Linear semi-lock resolution
Automated reasoning,Lattice (order),Computer science,Lock (computer science),Propositional calculus,Linguistics
Journal
Volume
Issue
ISSN
16
4
1432-7643
Citations 
PageRank 
References 
5
0.43
15
Authors
4
Name
Order
Citations
PageRank
Xingxing He18413.90
Yang Xu271183.57
Jun Liu364456.21
Shuwei Chen412112.14