Similarity mass and approximate reasoning |
| |
Authors: | Ya-lin Zheng Bing-yuan Cao Guang Yang Yong-cheng Bai |
| |
Institution: | (1) Department of Mathematics, University of Manchester, Manchester, M13 9PL, U.K. |
| |
Abstract: | It can reflect the nature of approximate reasoning and meet more application expectations to design the approximate reasoning
matching schemes and the corresponding algorithms with similarity relation Q instead of equivalence relation R. In this paper, based on similarity relation Q, we introduce type V matching scheme and corresponding approximate reasoning type V Q-algorithm with the given input A* and knowledge A → B. Besides, we present completeness of type V and its perfection on knowledge base K in Q-logic ℂ
Q
in this paper. |
| |
Keywords: | Approximate reasoning Formula mass Knowledge mass Q-logic Q-algorithm Q-completeness |
本文献已被 SpringerLink 等数据库收录! |