Nonsingleton fuzzy logic systems: theory and application

In this paper, we present a formal derivation of general nonsingleton fuzzy logic systems (NSFLSs) and show how they can be efficiently computed. We give examples for special cases of membership functions and inference and we show how an NSFLS can be expressed as a “nonsingleton fuzzy basis function” expansion and present an analytical comparison of the nonsingleton and singleton fuzzy logic systems formulations. We prove that an NSFLS can uniformly approximate any given continuous function on a compact set and show that our NSFLS does a much better job of predicting a noisy chaotic time series than does a singleton fuzzy logic system (FLS)