Abstract

This paper deals with how non-strong linguistic negations can be represented in Fuzzy Logic by means of Negation Functions. Even if the problem is not closed, the impossibility of representing by exhaustive Negation Functions those that are either weak, or intuitionistic, is proved. A hint on how to continue the study is presented.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call