Abstract
This paper focuses on refined non-clausal resolution methods in a Łukasiewicz first order logic Ln(X), i.e., α-generalized lock resolution with deleting strategies, which can further improve the efficiency of α-generalized lock resolution. First, the concepts of strong implication, weak implication, and ageneralized lock resolution with these two deleting strategies are given, respectively. Then the compatibilities of α-generalized lock resolution with strong implication deleting and weak implication deleting are shown in LnF(X), respectively. Finally, an algorithm for α-generalized resolution with these deleting strategies is given.
Original language | English |
---|---|
Pages (from-to) | 377-384 |
Number of pages | 8 |
Journal | Advances in Intelligent Systems and Computing |
Volume | 214 |
DOIs | |
Publication status | Published (in print/issue) - 2014 |
Event | 7th International Conference on Intelligent Systems and Knowledge Engineering, ISKE 2012 - Beijing, China Duration: 15 Dec 2012 → 17 Dec 2012 |
Bibliographical note
Funding Information:This work is partially supported by the National Natural Science Foundation of China (Grant No. 61175055, 61105059, 61100046) and Sichuan Key Technology Research and Development Program under Grant No. 2011FZ0051.
Keywords
- Deleting strategies
- Non-clausal resolution
- Łukasiewicz first order logic
- α-Generalized lock resolution