Abstract
Two-string fuzzy inference consists of two separate inference mechanisms: One conventional fuzzy inference system that processes recommending rules, as well as a mechanism for processing negative rules, which prevent the system from outputting their associated values when their premise is fulfilled. Two-string inference has valuable applications in pattern recognition and control tasks. We present a method rendering two-string inference applicable and computationally feasible in recurrent fuzzy systems, i.e. Mamdami-type fuzzy inference systems equipped with defuzzified state feedback. We show the efficiency of our approach by means of an illustrative example from biological systems modelling and suggest application areas for recurrent two-string fuzzy systems.
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.
