Algorithm of fuzzy reasoning has been successful applied in fuzzy control,but its theoretical foundation of algorithms has not been thoroughly investigated. In this paper,structure of basic algorithms of fuzzy reasoni...Algorithm of fuzzy reasoning has been successful applied in fuzzy control,but its theoretical foundation of algorithms has not been thoroughly investigated. In this paper,structure of basic algorithms of fuzzy reasoning was studied, its rationality was discussed from the viewpoint of logic and mathematics, and three theorems were proved. These theorems shows that there always exists a mathe-~matical relation (that is, a bounded real function) between the premises and the conclusion for fuzzy reasoning, and in fact various algorithms of fuzzy reasoning are specific forms of this function. Thus these results show that algorithms of fuzzy reasoning are theoretically reliable.展开更多
当模糊系统具有插值性时,它必具有泛逼近性.因此,由插值性可以分析模糊系统的逼近能力.本文讨论了由“交”和“并”的方式聚合推理规则所生成的两类模糊系统的插值性问题.首先,通过分析由“单点”模糊化方法、CRI(com positional ru le ...当模糊系统具有插值性时,它必具有泛逼近性.因此,由插值性可以分析模糊系统的逼近能力.本文讨论了由“交”和“并”的方式聚合推理规则所生成的两类模糊系统的插值性问题.首先,通过分析由“单点”模糊化方法、CRI(com positional ru le of inference)算法以及“重心法”构造的模糊系统,指出模糊系统是否具有插值性关键取决于模糊蕴含算子的第二个变量为0和1时的表达式或取值.在此基础上,得到两类模糊系统具有插值性的充要条件.最后给出了满足这两个充要条件的一些常用的蕴涵算子.展开更多
文摘Algorithm of fuzzy reasoning has been successful applied in fuzzy control,but its theoretical foundation of algorithms has not been thoroughly investigated. In this paper,structure of basic algorithms of fuzzy reasoning was studied, its rationality was discussed from the viewpoint of logic and mathematics, and three theorems were proved. These theorems shows that there always exists a mathe-~matical relation (that is, a bounded real function) between the premises and the conclusion for fuzzy reasoning, and in fact various algorithms of fuzzy reasoning are specific forms of this function. Thus these results show that algorithms of fuzzy reasoning are theoretically reliable.
文摘当模糊系统具有插值性时,它必具有泛逼近性.因此,由插值性可以分析模糊系统的逼近能力.本文讨论了由“交”和“并”的方式聚合推理规则所生成的两类模糊系统的插值性问题.首先,通过分析由“单点”模糊化方法、CRI(com positional ru le of inference)算法以及“重心法”构造的模糊系统,指出模糊系统是否具有插值性关键取决于模糊蕴含算子的第二个变量为0和1时的表达式或取值.在此基础上,得到两类模糊系统具有插值性的充要条件.最后给出了满足这两个充要条件的一些常用的蕴涵算子.
