摘要
本文首次提出“相异因子r”的概念,并在“使解B”的相异程度最小”的思想指导下,改进了三Ⅰ算法单纯地求满足条件的最小模糊集的方法,并分别讨论了在Lukasiewicz蕴涵算子和Zadeh蕴涵算子之下的FMP规则以及相应的算法表达式。
The 'incompatible factor' concept is introduced for the first time,and the Triple 1 method is improved with the thinking. The reason of why the new method should be more reasonable than the Triple I method is analyzed, then the new method is generalized by considering two different types of implication operations.
出处
《计算机科学》
CSCD
北大核心
2004年第2期98-100,116,共4页
Computer Science
基金
国家自然科学基金(批准号:60273087)
