Affiliation: | a Department of Industrial Engineering, University of Toronto, Toronto, Ontario, M5S IA4, Canada b Department of Computer Science, University of Texas at El Paso, El Paso, TX 79 968, USA c Machine Intelligence Institute, Iona College, 715 North Avenue, Nest Rochelle, NY 10801-18 903, USA |
Abstract: | ![]() Many different fuzzy implication operators have been proposed; most of them fit into one of the two classes: implication operations that are based on an explicit representation of implication A → B in terms of &, , and ¬ (e.g., S-implications that are based on the formula B ¬ A), and R-implications that are based on an implicit representation of implication A → B as the weakest C for which C&B implies A. However, some fuzzy implication operations (such as ba) cannot be naturally represented in this form. To describe such operations, we propose a new (third) class of implication operations called A-implications whose relation to &, , and ¬ is described by (implicit) axioms. |