Conjunctors and their residual implicators: characterizations and construction methods

In many practical applications of fuzzy logic it seems clear that one needs more flexibility in the choice of the conjunction: in particular, the associativity and the commutativity of a conjunction may be removed. Motivated by these considerations, we present several classes of conjunctors, i.e. binary operations on $[0,1]$ that are used to extend the boolean conjunction from $\{0,1\}$ to $[0,1]$, and characterize their respective residual implicators. We establish hence a one-to-one correspondence between construction methods for conjunctors and construction methods for residual implicators. Moreover, we introduce some construction methods directly in the class of residual implicators, and, by using a deresiduation procedure, we obtain new conjunctors

Bandler–Kohout Subproduct With Yager’s Classes of Fuzzy Implications

The Bandler-Kohout subproduct (BKS) inference mechanism is one of the two established fuzzy relational inference (FRI) mechanisms; the other one being Zadeh's compositional rule of inference (CRI). Both these FRIs are known to possess many desirable properties. It can be seen that many of these desirable properties are due to the rich underlying structure, viz., the residuated algebra, from which the employed operations come. In this study, we discuss the BKS relational inference system, with the fuzzy implication interpreted as Yager's classes of implications, which do not form a residuated structure on [0,1] . We show that many of the desirable properties, viz., interpolativity, continuity, robustness, which are known for the BKS with residuated implications, are also available under this framework, thus expanding the choice of operations available to practitioners. Note that, to the best of the authors' knowledge, this is the first attempt at studying the suitability of an FRI where the operations come from a nonresiduated structure