Abstract
This paper analyzes the characteristics of α-generalized semantic resolution, α-generalized linear resolution, and α-generalized lock resolution from their validity, complexity, and practicability in Ln×2F(X). Some examples are given to illustrate the efficiency of three non-clausal resolution methods.
Original language | English |
---|---|
Title of host publication | Foundations of Intelligent Systems - Proceedings of the 8th InternationalConference on Intelligent Systems and Knowledge Engineering, ISKE 2013 |
Publisher | Springer Verlag |
Pages | 35-42 |
Number of pages | 8 |
ISBN (Print) | 9783642549236 |
DOIs | |
Publication status | Published (in print/issue) - 2014 |
Event | 8th International Conference on Intelligent Systems and Knowledge Engineering, ISKE 2013 - Shenzhen, China Duration: 20 Nov 2013 → 23 Nov 2013 |
Publication series
Name | Advances in Intelligent Systems and Computing |
---|---|
Volume | 277 |
ISSN (Print) | 2194-5357 |
Conference
Conference | 8th International Conference on Intelligent Systems and Knowledge Engineering, ISKE 2013 |
---|---|
Country/Territory | China |
City | Shenzhen |
Period | 20/11/13 → 23/11/13 |
Bibliographical note
Funding Information:This work is partially supported by the National Natural Science Foundation of China (Grant Nos. 61305074, 61175055, 61105059, and 61100046) and Sichuan Key Technology Research and Development Program under Grant No. 2011FZ0051.
Keywords
- Lattice-valued logic
- α-Generalized linear resolution
- α-Generalized lock resolution
- α-Generalized semantic resolution