Paper Info
Title
Alpha-Generalized Lock Resolution Method In Linguistic Truth-Valued Lattice-Valued Logic
Abstract
This paper focuses on e fficient non-clausal resolution-based automated reasoning methods and algorithms for a lattice-ordered linguistic truth-valued logic, which corresponds to extensions of alpha-lock resolution. Firstly, alpha-generalized lock resolution is proposed for lattice-valued propositional logic and first order logic, respectively, along with their concepts, soundness and completeness. Then, alpha-generalized lock resolution for first order linguistic truth-valued lattice-valued logic LV(nx2)F(X) is equivalently transformed into that for propositional logic LnP(X), which can greatly reduce the complexity of the resolution procedure. Finally, alpha-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.
Year
DOI
Venue
2012
10.1080/18756891.2012.747665
INTERNATIONAL JOURNAL OF COMPUTATIONAL INTELLIGENCE SYSTEMS
Keywords
Field
DocType
Non-clausal resolution, alpha-Generalized lock resolution, alpha-Generalized linear semi-lock resolution, Linguistic truth-valued lattice-valued logic, Lattice implication algebras
Automated reasoning,Zeroth-order logic,Propositional calculus,First-order logic,Resolution (logic),Soundness,Linguistics,Completeness (statistics),Mathematics,Intermediate logic
Journal
Volume
Issue
ISSN
5
6
1875-6883
Citations 
PageRank 
References 
3
0.43
20
Authors
4
Name
Order
Citations
PageRank
Xingxing He18413.90
Yang Xu271183.57
Jun Liu341923.08
Shuwei Chen412112.14