Aiming at the previously-proposed entropy-based differently implicational algorithm of fuzzy inference, this study analyzes its continuity. To begin with, for the FMP (fuzzy modus ponens) and FMT (fuzzy modus tollens) problems, the continuous as well as uniformly continuous properties of the entropy-based differently implicational algorithm are demonstrated for the Tchebyshev and Hamming metrics, in which the R-implications derived from left-continuous t-norms are employed. Furthermore, four numerical fuzzy inference examples are provided, and it is found that the entropy-based differently implicational algorithm can obtain more reasonable solution in contrast with the fuzzy entropy full implication algorithm. Finally, in the entropy-based differently implicational algorithm, we point out that the first fuzzy implication reflects the effect of rule base, and that the second fuzzy implication embodies the inference mechanism.
The symmetric implicational method is revealed from a different perspective based upon the restriction theory, which results in a novel fuzzy inference scheme called the symmetric implicational restriction method. Initially, the SIR-principles are put forward, which constitute optimized versions of the triple I restriction inference mechanism. Next, the existential requirements of basic solutions are given. The supremum (or infimum) of its basic solutions is achieved from some properties of fuzzy implications. The conditions are obtained for the supremum to become the maximum (or the infimum to be the minimum). Lastly, four concrete examples are provided, and it is shown that the new method is better than the triple I restriction method, because the former is able to let the inference more compact, and lead to more and superior particular inference schemes.