z-logo
Premium
Logics with approximate premises
Author(s) -
Biacino Loredana,
Gerla Giangiacomo
Publication year - 1998
Publication title -
international journal of intelligent systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.291
H-Index - 87
eISSN - 1098-111X
pISSN - 0884-8173
DOI - 10.1002/(sici)1098-111x(199801)13:1<1::aid-int1>3.0.co;2-u
Subject(s) - propositional calculus , mathematics , antecedent (behavioral psychology) , premise , zeroth order logic , closure (psychology) , extension (predicate logic) , fuzzy logic , propositional variable , calculus (dental) , discrete mathematics , rule of inference , intermediate logic , artificial intelligence , computer science , linguistics , philosophy , psychology , multimodal logic , description logic , programming language , medicine , developmental psychology , dentistry , economics , market economy
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

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here