Compositions Consistent with the Modus Ponens Property Used in Approximate Reasoning

In this paper it is investigated when some kinds of aggregation functions satisfy the Modus Ponens with respect to other aggregation function, or equivalently, when they are \(\mathcal {A}\)-conditionals. Moreover, some operation connected with \(\mathcal {A}\)-conditionals is examined and used to algorithm of approximate reasoning.