Logics with approximate premises
Loredana Biacino, Giangiacomo Gerla · International Journal of Intelligent Systems · 1998
M. Ying proposed a propositional calculus in which the reasoning may be approximate by allowing the antecedent clause of a rule to match its premise only approximately. The aim of this note is to relate Ying's proposal to an extension principle for closure operators proposed by the authors. In this way it is possible to show that, in a sense, Ying's apparatus can be reduced to a fuzzy logic as defined by Pavelka [J. Pavelka, “On fuzzy logic I. Many valued rules of inference,” Zeitschrift fur Math. Logik und Grundlagen Math., 25, 45–52 (1979)]. © 1998 John Wiley & Sons, Inc.13: 1–10, 1998