The Robustness Of Universal Triple â…  Algorithms And Reverse Triple â…  Algorithms

This thesis is a robustness study on universal triple â…  algorithms and reverse triple â…  algorithms.First of all,The general expressions of solutions about the FMP and FMT interval-valued（1,2,2）-[α,β]type triple â…  methods are given.Also,the robustness of interval-valued（1,2,2）-[α,β]type triple â…  algorithms are discussed.The sensitivity of solutions about（1,2,2）-[α,β]type triple â…  algorithms based on interval-valued（?）₀ implication and （?）ukasiewicz implication is obtained.Then,the interval-valued（1,2,3）-[α,β]type triple â…  methods are studied.The expression of the solution is given.The robustness of interval-valued（1,2,3）-[α,β]type triple â…  algorithms are proved by Moore distance.Subsequently,interval-valued fuzzy reasoning is combined with reverse triple â…  restriction methods.The general expression of solutions about reverse triple â…  restriction algorithms for interval-valued fuzzy reasoning is given.The robustness of interval-valued reverse triple â…  restriction algorithms for interval-valued fuzzy reasoning is studied.The robustness of interval-valued reverse triple â…  restriction algorithms are proved.Finally,we discussed the robustness of theα-reverse triple â…  sustaining methods andα-reverse triple â…  restriction algorithms by means of the average logical similarity.It is showed that theα-reverse triple â…  sustaining methods of FMP（FMT）have the just as good robustness as theα-reverse triple â…  restriction algorithms.