Abstract
We focus in this paper on approximate reasoning in a symbolic framework, and more precisely in multi-valued logic. Approximate reasoning is based on a generalization of Modus Ponens, known as Generalized Modus Ponens (GMP). Its principle is that from an observation different but approximately equal to the rule premise, we can deduce a fact approximately equal to the rule conclusion. We propose a generalization of the approximate reasoning axiomatic introduced by Fukami, and we show the weakness of GMP approaches in the multi-valued context towards this axiomatic. Moreover, we propose two rules of symbolic GMP that check the axiomatic. One is based on the implication operator and the second on linguistic modifiers.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
