[en] In this communication we propose two logically sound fuzzification and defuzzifi-
cation techniques for implementing a credibility calculus on a set of propositional
expressions. Both rely on a credibility evaluation domain using the rational in-
terval [−1, 1] where the sign carries a split truth/falseness denotation. The first
technique implements the classic min and max operators where as the second
technique implements Bochvar-like operators. Main interest in the communica-
tion is given to the concept of natural fuzzification of a propositional calculus.
A formal definition is proposed and the demonstration that both fuzzification
techniques indeed verify this definition is provided.
Disciplines :
Mathematics
Author, co-author :
Bisdorff, Raymond ; University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC)
External co-authors :
no
Language :
English
Title :
On a natural fuzzification of Boolean logic
Publication date :
February 2004
Event name :
25th Linz Seminar on Fuzzy Set Theory, Mathematics of Fuzzy Systems.
Event organizer :
Bildungszentrum St. Magdalena
Event place :
Linz, Austria
Event date :
02-2004
Audience :
International
Main work title :
Proceedings of the 25th Linz Seminar on Fuzzy Set Theory, Mathematics of Fuzzy Systems