Skip to main content

Type-1 Fuzzy Sets and Fuzzy Logic

  • Chapter
  • First Online:
Uncertain Rule-Based Fuzzy Systems

Abstract

This chapter formally introduces type-1 fuzzy sets and fuzzy logic . It is the backbone for Chap. 3 and provides the foundation upon which type-2 fuzzy sets and systems are built in later chapters. Its coverage includes: crisp sets , type-1 fuzzy sets and associated concepts [including a short biography of Prof. Zadeh (the father of fuzzy sets and fuzzy logic)], type-1 fuzzy set defined, linguistic variables , returning to linguistic variables from a numerical value of a membership function , set theoretic operations for crisp and type-1 fuzzy sets, crisp and fuzzy relations and compositions on the same or different product spaces , compositions of a type-1 fuzzy set with a type-1 fuzzy relation , hedges, the Extension Principle (which is about functions of fuzzy sets), α-cuts (which are a powerful way to represent a type-1 fuzzy set in terms of intervals), functions of type-1 fuzzy sets computed by using α-cuts , multivariable membership functions and Cartesian products , crisp logic , going from crisp logic to fuzzy logic, Mamdani (engineering) implications , some final remarks, and an appendix about properties/laws of type-1 fuzzy sets . 35 examples are used to illustrate this chapter’s important concepts.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Notes

  1. 1.

    The English word “fuzzy” has a negative connotation when it used in a technical context. It may be okay to describe a soft teddy bear, a cuddly pet, or a peach but for it to be used for mathematics and its applications is a red flag. Prof. Zadeh was well aware of this but felt that in 1965 “fuzzy” was the best word for him to use for this kind of a set. I propose that, after more than 50 years, these sets be called Zadehian sets. I am not going to use my proposed replacement in this book, because, although I would like to do it, if I did almost no one would know what I was talking about.

  2. 2.

    This short biographical sketch was taken mostly from Mendel (2007).

  3. 3.

    In order to distinguish among different fuzzy set models, what were originally called fuzzy sets are in this book called type-1 fuzzy sets. Beginning with Chap. 6, type-2 fuzzy sets are studied.

  4. 4.

    Fuzzy set notation was introduced in Zadeh (1965) and has remained popular for more than 50 years, although many people find it somewhat strange and object to its use of symbols such as the integral and summation. Aisbett et al. (2010) distinguish between “fuzzy set notation” and “standard mathematical notation.” In Definition 2.1, \( \mu_{A} {:}X \to [0,1] \) is the description of a type-1 fuzzy set in standard mathematical notation. My own preference is to use each notation where it is useful.

  5. 5.

    For fuzzy sets, there is absolutely no requirement that \( \mu_{D} (x) + \mu_{F} (x) = 1 \), even though some authors impose this (e.g., Ruspini 1969; Bezdek 1981). When the constraint that the sum of the fuzzy set memberships must add to 1 for \( x \in X \) is imposed, the result is called a fuzzy partition. Fuzzy partitions are not used in this book because, in the opinion of this author, they impose unnecessary constraints on fuzzy set MFs, especially when MF parameters are optimized, as is commonly done in rule-based fuzzy systems.

  6. 6.

    In mathematics a real-value function \( f(x) \) defined on an interval is called convex if the line segment between any two points on the graph of the function lies above or on the graph (e.g., a parabola). Why the fuzzy set A that satisfies (2.6) is called “convex” rather than “concave” is a bit mysterious. Maybe it is due to a concave function also being known in mathematics as a convex upwards, convex cap, or upper convex function .

  7. 7.

    Although “term” means one or more words, it is quite common in the fuzzy set literature to see “word” used instead of “term,” even when a term includes more than one word. In this book, “term” and “word” are also used interchangeably.

  8. 8.

    Because some of the linguistic terms may be so similar to each other, it may not be necessary to use all of them. One usually chooses the linguistic terms so that their MFs overlap and cover X.

  9. 9.

    There is a small subset of type-1 fuzzy set theory that requires both of these laws to be satisfied. This work has had no impact on rule-based fuzzy systems and so it is not discussed in this book.

  10. 10.

    The axiomatic basis for a t-conorm is, for a, b, d \( \in \) [0,1]: (1) boundary condition, \( s(a,0) = a \); (2) monotonicity, \( b \le d \Rightarrow s(a,b) \le s(a,d) \); (3) commutativity, \( s(a,b) = s(b,a) \); and, (4) associativity, \( s(a,s(b,d)) = s(s(a,b),d) \). Table 3.3 in Klir and Yuan (1995) lists 11 t-conorms.

  11. 11.

    The axiomatic basis for a t-norm is, for a, b, d \( \in \) [0,1]: (1) boundary condition, \( t(a,1) = a \); (2) monotonicity, \( b \le d \Rightarrow t(a,b) \le t(a,d) \); (3) commutativity, \( t(a,b) = t(b,a) \); and, (4) associativity, \( t(a,t(b,d)) = t(t(a,b),d) \). Table 3.2 in Klir and Yuan (1995) lists 11 t-norms.

  12. 12.

    The axiomatic basis for a fuzzy complement is: (1) boundary conditions, \( c(0) = 1 \) and \( c(1) = 0 \), and (2) monotonicity, for all \( a,b \in [0,1] \), if \( a \le b \) then \( c(a) \ge c(b) \). There are also many fuzzy complements that additionally satisfy the involutive condition \( c(c(a)) = a \).

  13. 13.

    Some examples of dual pairs with respect to the fuzzy complement (2.19) are: min and max, and product and algebraic sum. See Klir and Yuan (1995, pp. 83–88) for discussions about and properties of dual pairs. Some of their Chap. 3 end-notes provide interesting historical remarks about the origins of t-norms and t-conorms.

  14. 14.

    Most of this paragraph is taken from Karnik and Mendel (2001, p. 337).

  15. 15.

    This theorem and its proof are taken from Karnik and Mendel, (1998, pp. 61–62).

  16. 16.

    Recall that \( \overline{{{\text{at least (}} \cdot )}} = {\text{no }}( \cdot ) \).

  17. 17.

    Let S be a set of real numbers. An upper bound for S is a number b such that \( x \le b \) for all \( x \in S \). The supremum of S, if it exists, is the smallest upper bound for S. An upper bound that actually belongs to the set is called a maximum.

  18. 18.

    Some of the material in this section is taken from Mendel and Wu (2010, Sect. 3.6) and Mendel (1995a, p. 356).

  19. 19.

    Hedges should only operate on primary terms for which the hedged term makes linguistic sense, e.g. the hedge much makes no linguistic sense when it is applied to the primary term low pressure.

  20. 20.

    Because of the uncertainty about the numerical values of the exponents, hedges might be more appropriately modeled within the framework of type-2 fuzzy sets. This is examined in Sect. 7.10.

  21. 21.

    According to Klir and Yuan (1995), the Extension Principle was introduced in Zadeh (1975); however, Zadeh (1975, p. 236, footnote 18) states that the Extension Principle is implicit in a result given in Zadeh (1965).

  22. 22.

    Actually, there are other Extension Principles (e.g., He, et al. 2000; Arabi, et al. 2001), but the one that is described in this section is the most widely used and is the one used in the rest of this book.

  23. 23.

    A plausibility argument for the Extension Principle is: (1) \( y = f(x_{1} ,x_{2} ) \) can be interpreted literally, as: When \( x_{1} = x^{\prime}_{1} \) and \( x_{2} = x^{\prime}_{2} \) then \( y = f(x^{\prime}_{1} ,x^{\prime}_{2} ) \), where the and in this statement is modeled as a conjunction, which explains the use of the minimum in (2.68); and, (2) when \( y = f(x_{1} ,x_{2} ) \) is many-to-one, then this can be interpreted as: For \( (x_{1} ,x_{2} ) = (x_{1}^{1} ,x_{2}^{1} ) \) or \( (x_{1}^{2} ,x_{2}^{2} ) \) oror \( (x_{1}^{m} ,x_{2}^{m} ) \), the same value is obtained for \( y = f(x_{1} ,x_{2} ) \), where the or’s in this statement are modeled as disjunctions, which explains the use of the maximum (sup) in (2.68).

  24. 24.

    Equation (2.70) assumes that \( x_{1} ,\ldots,x_{r} \) are non-interactive (e.g., if \( x_{1} = a \) and \( x_{2} = a^{2} \), then \( x_{1} \) and \( x_{2} \) are interactive) or that there is no joint constraint on \( x_{1} ,\ldots,x_{r} \). For a detailed discussion about this, see Zadeh (1975), Appendix B in Karnik and Mendel (1998) and Rajati and Mendel (2013).

  25. 25.

    Note that \( 1{\star}1 = 1 \) regardless of whether the t-norm is minimum or product.

  26. 26.

    Recall that \( A_{\alpha } \cup B_{\alpha } \) is a set of real numbers that includes all elements in either \( A_{\alpha } \) or \( B_{\alpha } \).

  27. 27.

    Much of the material in this section (up to Example 2.29) is taken from Mendel and Wu (2010, Sect. 5A.2, © IEEE 2010).

  28. 28.

    The statement of this theorem is adapted from Klir and Yuan (1995, Theorem 2.9) and is taken from Mendel and Wu (2010). Zadeh (1975) states this result without a proof for it. Nguyen (1978) seems to be the first to provide necessary and sufficient conditions for (2.98) to hold.

  29. 29.

    This proof is similar to the one that is given for Theorem 2.9 in Klir and Yuan (1995), where it is only provided for a function of a single variable. Even so, our proof of Theorem 2.4 follows the proof of their Theorem 2.9 very closely; however, their theorem does not explain how sub-normal type-1 fuzzy sets should be handled. Such sub-normal type-1 fuzzy sets are quite common in type-2 fuzzy sets because many kinds of lower MFs (see Chap. 6) are sub-normal.

  30. 30.

    This example is adapted from Dutta, et al. (2011).

  31. 31.

    Much of the rest of this section is paraphrased from Allendoerfer and Oakley (1955).

  32. 32.

    A named implication MF (e.g., Kleene-Dienes) refers to the person or persons attributed to it in Klir and Yuan (1995, Table 11.1, p. 309).

  33. 33.

    There is a paragraph in the lower right-hand column on p. 359 of Mendel (1995a) that contains an error. Observe that the derivation of (2.129) has accounted for all values of x, including \( x \ne x^{\prime } \), because it uses (2.128). For some reason that I cannot recall, in the erroneous paragraph, I claim that for all \( x \ne x^{\prime } \), \( \mu_{{B^{*} }} (y) = 1 \), which I then interpret as a form of non-causality, i.e., a rule will be fired for all \( x \ne x^{\prime } \). I then argue for the use of a Mamdani or Larsen implication on the basis of their causality. This is incorrect; however, it does not affect anything else in the 1995 tutorial.

  34. 34.

    This is based on Ockham’s razor principle; see footnote 13 in Chap. 6 (page 272) for a discussion about this principle.

  35. 35.

    The rest of the material in this section is taken for the most part from Mendel (1995a).

  36. 36.

    This exercise is adapted from Wang and Mendel (2016).

  37. 37.

    This exercise is adapted from Dutta et al. (2011).

  38. 38.

    This exercise is adapted from Dutta et al. (2011).

  39. 39.

    The wording of the rest of this exercise is taken from Wu and Mendel (2007, p. 5383). The following is also taken from Wu and Mendel (2007, pp. 5382–5383): Definitions of the cardinality of type-1 fuzzy sets have been proposed by several authors, including De Luca and Termini (1972), Kaufman (1977), Gottwald (1980), Zadeh (1981), Blanchard (1982), Klement (1982) and Wygralak (1983). Basically there are two kinds of proposals (Dubois and Prade 1985; Wygralak 2003): (1) those that assume that the cardinality of a type-1 fuzzy set should be a precise number, and (2) those that claim it should be a fuzzy integer. De Luca and Termini’s definition of cardinality (also called the power of a type-1 fuzzy set) is for the first proposal, is the one that is given in the statement of this exercise, and is the most frequently used definition of cardinality.

  40. 40.

    Please note that the use of a crisp number for the similarity of type-1 fuzzy sets is not being absolutely advocated for. Arguments can be given for using a type-1 fuzzy set similarity measure just as well as or for using a crisp number for similarity. The application may dictate which kind of measure is preferable. Of greater importance is that a similarity measure should satisfy some desirable properties, otherwise any kind of a measure between two type-1 fuzzy sets could be claimed to be a similarity measure. Four desirable properties for a type-1 fuzzy set similarity measure \( sm(A,B) \) are (e.g., Mendel and Wu 2010, Ch. 4): (1) Reflexivity: \( sm(A,B) = 1 \Leftrightarrow A = B \); (2) Symmetry: \( sm(A,B) = sm(B,A) \); (3) Transitivity: If \( C \le A \le B \) (Note: \( A \le B \) if \( \mu_{A} (x) \le \mu_{B} (x) \) for \( x \in X \)), where C is an arbitrary fuzzy set on domain X, then \( sm(C,A) \ge sm(C,B) \); and (4) Overlapping: If \( A \cap B \ne \emptyset \), then \( sm(A,B) > 0 \); otherwise, \( sm(A,B) = 0 \). \( sm_{J} (A,B) \) satisfies these four properties.

  41. 41.

    Please note that the use of a crisp number for the subsethood of type-1 fuzzy sets is not being absolutely advocated for. Arguments can be given for using a type-1 fuzzy set subsethood measure just as well as or for using a crisp number for subsethood. The application may dictate which kind of measure is preferable. Of greater importance is that a subsethood measure should satisfy some desirable properties, otherwise any kind of a measure between two type-1 fuzzy sets could be claimed to be a subsethood measure. Three desirable properties for type-1 fuzzy set subsethood measure \( ss(A,B) \) are (e.g., Mendel and Wu 2010, Ch. 4): (1) Reflexivity: \( ss(A,B) = 1 \Leftrightarrow A \le B \) (Note: \( A \le B \) if \( \mu_{A} (x) \le \mu_{B} (x) \) for \( x \in X \)); (2) Transitivity: If \( C \le A \le B \), then \( ss(A,C) \ge ss(B,C) \), where C is an arbitrary fuzzy set on domain X, or if \( A \le B \), then \( ss(C,A) \le ss(C,B) \) for any C; and (3) Overlapping: If \( A \cap B \ne \emptyset \), then \( ss(A,B) > 0 \); otherwise, \( ss(A,B) = 0 \). \( ss_{K} (A,B) \) satisfies these three properties. The interested reader is referred to, e.g. Young (1996) and Fan et al. (1999).

References

  • Aisbett, J., J.T. Rickard, and D.G. Morgenthaler. 2010. Type-2 fuzzy sets as functions on spaces. IEEE Trans on Fuzzy Systems 18: 841–844.

    Article  Google Scholar 

  • Allendoerfer, C.B., and C.O. Oakley. 1955. Principles of mathematics. New York: McGraw-Hill.

    MATH  Google Scholar 

  • Arabi, B.N., N. Kehtarnavaz, and C. Lucas. 2001. Restrictions imposed by the fuzzy extension of relations and functions. Journal of Intelligent and Fuzzy Systems 11: 9–22.

    Google Scholar 

  • Bezdek, J.C. 1981. Pattern recognition with fuzzy objective function algorithms. New York: Plenum.

    Book  MATH  Google Scholar 

  • Bezdek, J., and S.K. Pal. 1992. Fuzzy models for pattern recognition. New York: IEEE Press.

    Google Scholar 

  • Blanchard, N. 1982. Cardinal and ordinal theories about fuzzy sets. In Fuzzy Information and Decision Process, ed. M. M. Gupta and E. Sanchez, pp. 149–157, Amsterdam.

    Google Scholar 

  • Bonissone, P. P. and K. S. Decker. 1986. Selecting uncertainty calculi and granularity: An experiment in trading off precision and complexity. In Uncertainty in artificial intelligence, ed. L. N. Kanal and J. F. Lemmer, pp. 217–247, Amsterdam.

    Google Scholar 

  • Cheeseman, P. 1988. An inquiry into computer understanding. Computational Intelligence 4: 57–142 (with 22 commentaries/replies).

    Google Scholar 

  • Cox, E.A. 1994. The fuzzy systems handbook. Cambridge, MA: AP Professional.

    MATH  Google Scholar 

  • Cox, E. A. 1992. Fuzzy fundamentals. IEEE Spectrum, pp. 58–61, Oct. 1992.

    Google Scholar 

  • Dubois, D., and H. Prade. 1980. Fuzzy sets and systems: Theory and applications. NY: Academic Press.

    MATH  Google Scholar 

  • Dubois, D., and H. Prade. 1985. Fuzzy cardinality and the modeling of imprecise quantification. Fuzzy Sets and Systems 16: 199–230.

    Article  MathSciNet  MATH  Google Scholar 

  • Dutta, P. H. Boruah and T. Ali. 2011. Fuzzy arithmetic with and without using the α-cut method: A comparative study. International Journal of Latest Trends in Computing 2(1): 99–107 (E-ISSN: 2045-5364).

    Google Scholar 

  • Edwards, W.F. 1972. Likelihood. London: Cambridge Univ. Press.

    MATH  Google Scholar 

  • Fan, J.L., W.X. Xie, and J. Pei. 1999. Subsethood measure: new definitions. Fuzzy Sets and Systems 106: 201–209.

    Article  MathSciNet  MATH  Google Scholar 

  • Gottwald, S. 1980. A note on fuzzy cardinals. Kybernetika 16: 156–158.

    MathSciNet  MATH  Google Scholar 

  • He, Q., H.-X. Li, C.L.P. Chen, and E.S. Lee. 2000. Extension principles and fuzzy set categories. Computers and Mathematics with Applications 39: 45–53.

    Article  MathSciNet  MATH  Google Scholar 

  • Horikawa, S., T. Furahashi and Y. Uchikawa. 1992. On fuzzy modeling using fuzzy neural networks with back-propagation algorithm. IEEE Transaction on Neural Networks 3: 801–806.

    Google Scholar 

  • Jaccard, P. 1908. Nouvelles recherches sur la distribution florale. Bulletin de la Societe de Vaud des Sciences Naturelles 44: 223, 1908.

    Google Scholar 

  • Jang, J.-S.R. 1992. Self-learning fuzzy controllers based on temporal back-propagation. IEEE Transaction on Neural Networks 3: 714–723.

    Article  Google Scholar 

  • Jang, L.-C., and D. Ralescu. 2001. Cardinality concepts for type-two fuzzy sets. Fuzzy Sets and Systems 118: 479–487.

    Article  MathSciNet  MATH  Google Scholar 

  • Jang, J.-S. R., C-T. Sun and E. Mizutani. 1997. Neuro-fuzzy and soft-computing, Prentice-Hall, Upper Saddle River, NJ.

    Google Scholar 

  • Karnik, N.N., and J.M. Mendel. 2001. Operations on type-2 fuzzy sets. Fuzzy Sets and Systems 122: 327–348.

    Article  MathSciNet  MATH  Google Scholar 

  • Karnik, N. N. and J. M. Mendel. 1998. An introduction to type-2 fuzzy logic systems, USC-SIPI Report #418, Univ. of Southern Calif., Los Angeles, CA, June 1998. This can be accessed at: http://sipi.usc.edu/research; then choose “sipi technical reports/418.

  • Kaufmann, A. 1977. Introduction a la theorie des sous-ensembles flous, complement et nouvelles applications, vol. 4. Paris: Masson.

    MATH  Google Scholar 

  • Klement, E. P. 1982. On the cardinality of fuzzy sets. Proceedings of 6th European meeting on cybernetics and systems research, Vienna, pp. 701–704.

    Google Scholar 

  • Klir, G.J., and T.A. Folger. 1988. Fuzzy sets, uncertainty, and information. Englewood Cliffs, NJ: Prentice Hall.

    MATH  Google Scholar 

  • Klir, G.J., and B. Yuan. 1995. Fuzzy sets and fuzzy logic: Theory and applications. Upper Saddle River, NJ: Prentice Hall.

    MATH  Google Scholar 

  • Kosko, B. 1990. Fuzziness versus probability. International Journal of General Systems 17: 211–240.

    Article  MATH  Google Scholar 

  • Kosko, B. 1992. Neural network and fuzzy systems, a dynamical systems approach to machine intelligence. Englewood Cliffs, NJ: Prentice-Hall.

    MATH  Google Scholar 

  • Kosko. 1986. Fuzzy entropy and conditioning. Information Sciences 40: 165–174.

    Google Scholar 

  • Kreinovich, V. 2008. Relations between interval computing and soft computing. In Processing with interval and soft computing, ed. A. de Korvin and V. Kreinovich, 75–97. Springer, London.

    Google Scholar 

  • Larsen, P. M. 1980. Industrial applications of fuzzy logic control. International Journal Man-Machine Studies 12: 3–10.

    Google Scholar 

  • Laviolette, M., and J.W. Seaman Jr. 1994. The efficacy of fuzzy representations and uncertainty. IEEE Transaction on Fuzzy Systems 2: 4–15.

    Article  Google Scholar 

  • Lin, C.-T., and C.S.G. Lee. 1996. Neural fuzzy systems: A neuro-fuzzy synergism to intelligent systems. Upper Saddle River, NJ: Prentice-Hall PTR.

    Google Scholar 

  • Lindley, B. Y. 1982. Scoring rules and the inevitability of probability. International Statistical Review 50: 1–26 (with 7 commentaries/replies).

    Google Scholar 

  • De Luca, A., and S. Termini. 1972. A definition of non-probabilistic entropy in the setting of fuzzy sets theory. Information and Computation 20: 301–312.

    MathSciNet  MATH  Google Scholar 

  • Macvicar-Whelen, P. J. 1978. Fuzzy sets, the concept of height, and the hedge ‘very’. IEEE Transaction on Systems, Man, and Cybernetics SMC-8: 507–511.

    Google Scholar 

  • Mamdani, E.H. 1974. Applications of fuzzy algorithms for simple dynamic plant. Proceedings of the IEEE 121: 1585–1588.

    Google Scholar 

  • Mendel, J.M. 1995a. Fuzzy logic systems for engineering: A tutorial. IEEE Proceedings 83: 345–377.

    Article  Google Scholar 

  • Mendel, J.M. 1995b. Lessons in estimation theory for signal processing. Prentice-Hall PTR, Englewood Cliffs, NJ: Communications and Control.

    MATH  Google Scholar 

  • Mendel, J.M. 2007. Computing with words: Zadeh, Turing, Popper and Occam. IEEE Computational Intelligence Magazine 2: 10–17.

    Article  Google Scholar 

  • Mendel, J.M. 2015. Type-2 fuzzy sets and systems: A retrospective. Informatik Spektrum 38 (6): 523–532.

    Article  Google Scholar 

  • Mendel, J.M., H. Hagras, W.-W. Tan, W.W. Melek, and H. Ying. 2014. Introduction to type-2 fuzzy logic control. Hoboken, NJ: John Wiley and IEEE Press.

    Book  MATH  Google Scholar 

  • Mendel, J.M., and D. Wu. 2010. Perceptual computing: Aiding people in making subjective judgments. Hoboken, NJ: Wiley and IEEE Press.

    Book  Google Scholar 

  • Nguyen, H.T. 1978. A note on the extension principle for fuzzy sets. Journal of Mathematical Analysis and Applications 64: 369–380.

    Article  MathSciNet  MATH  Google Scholar 

  • Nguyen, H. T. and V. Kreinovich. 2008. Computing degrees of subsethood and similarity for interval-valued fuzzy sets: Fast algorithms. In Proceedings of 9th international conference on intelligent technologies in tech’08, pp. 47–55, Samui, Thailand, Oct. 2008.

    Google Scholar 

  • Rajati, M.R., and J.M. Mendel. 2013. Novel weighted averages versus normalized sums in computing with words. Information Sciences 235: 130–149.

    Article  MathSciNet  MATH  Google Scholar 

  • Rudin, W. 1966. Real and complex analysis. New York: Mc-Graw Hill.

    MATH  Google Scholar 

  • Ruspini, E. 1969. A new approach to clustering. Information Control 15: 22–32.

    Article  MATH  Google Scholar 

  • Schmucker, K.S. 1984. Fuzzy set, natural language computations, and risk analysis. Rockville, MD: Computer Science Press.

    MATH  Google Scholar 

  • Wang, L.-X. 1997. A course in fuzzy systems and control. Upper Saddle River, NJ: Prentice-Hall.

    MATH  Google Scholar 

  • Wang, L.-X., and J.M. Mendel. 2016. Fuzzy opinion networks: A mathematical framework for the evolution of opinions and their uncertainties across social networks. IEEE Transaction on Fuzzy Systems 24: 880–905.

    Article  Google Scholar 

  • Wang, L.-X. and J. M. Mendel. 1992a. Fuzzy basis functions, universal approximation, and orthogonal least squares learning. IEEE Trans. on Neural Networks 3: 807–813.

    Google Scholar 

  • Wang, L.-X. and J. M. Mendel. 1992b. Back-propagation of fuzzy systems as non-linear dynamic system identifiers. Proceedingas of IEEE intternational conference on fuzzy systems, 1409–1418, San Diego, CA.

    Google Scholar 

  • Wei, S-H. and S-M. Chen. 2009. Fuzzy risk analysis based on interval-valued fuzzy numbers. Expert Systems with Applications 36: 2285–2299.

    Google Scholar 

  • Wu, D., and J.M. Mendel. 2007. Uncertainty measures for interval type-2 fuzzy sets. Information Sciences 177: 5378–5393.

    Article  MathSciNet  MATH  Google Scholar 

  • Wygralak, M. 1983. A new approach to the fuzzy cardinality of finite fuzzy sets. Busefal 15: 72–75.

    MATH  Google Scholar 

  • Wygralak, M. 2003. Cardinalities of fuzzy sets. Heidelberg: Springer.

    Book  MATH  Google Scholar 

  • Yager, R.R. 1986. A characterization of the fuzzy extension principle. Journal Fuzzy Sets and Systems 18: 205–217.

    Article  MathSciNet  MATH  Google Scholar 

  • Yager, R.R., and D.P. Filev. 1994. Essentials of fuzzy modeling and control. New York: Wiley.

    Google Scholar 

  • Young, V.R. 1996. Fuzzy subsethood. Fuzzy Sets and Systems 77: 371–384.

    Article  MathSciNet  MATH  Google Scholar 

  • Zadeh, L.A. 1965. Fuzzy sets. Information and Control 8: 338–353.

    Article  MathSciNet  MATH  Google Scholar 

  • Zadeh, L.A. 1971. Similarity relations and fuzzy orderings. Information Sciences 3 (2): 177–200.

    Article  MathSciNet  MATH  Google Scholar 

  • Zadeh, L.A. 1972. A fuzzy-set-theoretic interpretation of iinguistic hedges. Journal of Cybernetics 2: 4–34.

    Article  MathSciNet  Google Scholar 

  • Zadeh, L.A. 1981. Possibility theory and soft data analysis. In Mathematical frontiers of the social and policy sciences, ed. L. Cobb, and R.M. Thrall, 69–129. CO: Westview Press, Boulder.

    Google Scholar 

  • Zadeh, L. A. 1973. Outline of a new approach to the analysis of complex systems and decision processes. IEEE Transaction on Systems, Man, and Cybernetics SMC-3: 28–44.

    Google Scholar 

  • Zadeh, L. A. 1975. The concept of a linguistic variable and Its application to approximate reasoning–1. Information Sciences 8: 199–249.

    Google Scholar 

  • Zadeh, L. A. 1999. From computing with numbers to computing with words—from manipulation of measurements to manipulation of perceptions. IEEE Transaction on Circuits and Systems–I: Fundamental Theory and Applications, 4: 105–119.

    Google Scholar 

  • Zimmermann, H.J. 1991. Fuzzy set theory and its applications, 2nd ed. Boston, MA: Kluwer Academic Publ.

    Book  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jerry M. Mendel .

Appendices

Appendix 1: Properties of Type-1 Fuzzy Sets

This appendix presents details about properties/laws of type-1 fuzzy sets and examines the following frequently used laws to see if they remain satisfied under maximum t-conorm and either minimum or product t-norms:

Reflexive, anti-symmetric, transitive, idempotent, commutative, associative, absorption, distributive, involution, De Morgan’s, and identity

Our reason for doing this is that rules in a rule-based system may make use of the words “and”, “or”, “unless”, “not”, etc., but all of the mathematics for such a system is worked out in this book only for canonical rules that use the words “and” and “or”. Section 3.2 shows how the former rules can be transformed into the canonical rules by using some of the above laws. So, it is important to know when or if the use of these laws is correct.

The exact nature of all the preceding laws is given in the second column of Table 2.8. These laws are all satisfied for crisp sets (for the minimum and product t-norms), due to the facts that: \( \hbox{min} (0,0) = 0{\text{ and }}0 \times 0 = 0 \), \( \hbox{min} (1,0) = 0{\text{ and }}1 \times 0 = 0 \), \( \hbox{min} (0,1) = 0{\text{ and }}0 \times 1 = 0 \), and, \( \hbox{min} (1,1) = 1 \) and \( 1 \times 1 = 1 \). That they are all satisfied for maximum t-conorm and minimum t-norm (a so-called “dual t-conorm and t-norm pair”) is well known (e.g. Klir and Yuan 1995) and proofs for this situation are left to the reader (Exercise 2.41).

Table 2.8 Summary of set-theoretic laws and whether or not they are satisfied for type-1 fuzzy sets under maximum t-conorm and either minimum or product t-normsa

The rest of this appendix focuses on the maximum t-norm and product t-norm pairing. Reflexive, anti-symmetric, and transitive laws do not make use of any t-norm; hence, they are automatically satisfied for maximum t-conorm and product t-norm. Commutative and associative laws are also satisfied, because both maximum and product operations are commutative and associative; i.e., for \( x \in X \) (\( \vee \equiv {\text{ maximum}} \)):

$$ \mu_{A} (x) \vee \mu_{B} (x) = \mu_{B} (x) \vee \mu_{A} (x) $$
$$ \mu_{A} (x) \times \mu_{B} (x) = \mu_{B} (x) \times \mu_{A} (x) $$
$$ (\mu_{A} (x) \vee \mu_{B} (x)) \vee \mu_{C} (x) = \mu_{A} (x) \vee (\mu_{B} (x) \vee \mu_{C} (x)) $$
$$ (\mu_{A} (x) \times \mu_{B} (x)) \times \mu_{C} (x) = \mu_{A} (x) \times (\mu_{B} (x) \times \mu_{C} (x)) $$

Under product t-norm, the second part of the absorption laws is satisfied, because \( \mu_{A} (x) \times \mu_{B} (x) \le \mu_{A} (x) \), so that \( \mu_{A} (x) \vee (\mu_{A} (x) \times \mu_{B} (x)) = \mu_{A} (x) \). The first part of the distributive laws is satisfied; i.e., product is distributive over maximum. The first part of the idempotent laws is also satisfied; i.e., \( \mu_{A} (x) \vee \mu_{A} (x) \) \( = \mu_{A} (x) \). The involution law is satisfied, since complement is defined as \( \mu_{{\bar{A}}} (x) = 1 - \mu_{A} (x) \). And, all the identity laws are satisfied (i.e., \( \mu_{A} (x) \vee 0 \) \( = \mu_{A} (x) \), \( \mu_{A} (x) \times 1 = \mu_{A} (x) \), \( \mu_{A} (x) \vee 1 = 1 \), and \( \mu_{A} (x) \times 0 = 0 \)).

None of the other laws are satisfied under product t-norm, because:

  • Idempotent laws—second part

    $$ \mu_{A} (x) \times \mu_{A} (x) \ne \mu_{A} (x) $$
    (2.150)
  • Absorption laws—first part: assume, e.g. that \( \mu_{A} (x) > \mu_{B} (x) \); then,

    $$ \mu_{A} (x) \times (\mu_{A} (x) \vee \mu_{B} (x)) = \mu_{A} (x) \times \mu_{A} (x) = \mu_{A}^{2} (x) \ne \mu_{A} (x) $$
    (2.151)
  • Distributive laws–second part: assume, e.g. that \( \mu_{A} (x) > \mu_{B} (x) \) and \( \mu_{A} (x) > \mu_{C} (x) \); then,

    $$ \begin{aligned} \mu_{A} (x) \vee (\mu_{B} (x) \times \mu_{C} (x)) & = \mu_{A} (x) \\ & \ne (\mu_{A} (x) \vee \mu_{B} (x)) \times (\mu_{A} (x) \vee \mu_{C} (x)) = \mu_{A}^{2} (x) \\ \end{aligned} $$
    (2.152)
  • De Morgan’s laws:

    $$ \begin{aligned} \overline{{\mu_{A} (x) \vee \mu_{B} (x)}} & = 1 - (\mu_{A} (x) \vee \mu_{B} (x)) \\ & \ne \mu_{{\bar{A}}} (x) \times \mu_{{\bar{B}}} (x) = (1 - \mu_{A} (x)) \times (1 - \mu_{B} (x)) \\ \end{aligned} $$
    (2.153)
    $$ \begin{aligned} \overline{{\mu_{A} (x) \times \mu_{B} (x)}} & = 1 - \mu_{A} (x) \times \mu_{B} (x) \\ & \ne \mu_{{\bar{A}}} (x) \vee \mu_{{\bar{B}}} (x) = \hbox{max} \{ (1 - \mu_{A} (x)),(1 - \mu_{B} (x))\} \\ \end{aligned} $$
    (2.154)

Exercises

  1. 2.1

    Fuzziness as a concept that lets an object reside in more than one set but to different degrees may be traced back to antiquity. Go on the Internet and find a picture of the statue called the Guardian Sphinx (530 BC.).

    1. (a)

      What are the three sets for this statue?

    2. (b)

      What membership grade would you assign to each of the three sets?

  2. 2.2

    Fuzziness as a concept that lets an object reside in more than one set but to different degrees has occurred in art, even before Zadeh formalized it. For example, it occurs in the works of the Belgian painter Renè Magritte. Go on the Internet and find the following paintings by him and answer the related question:

    1. (a)

      The Explanation (1952): What is the degree of similarity between the carrot and the wine bottle?

    2. (b)

      Homage to Alphonse Allais (1964): What is the degree of similarity between the cigar and the fish?

  3. 2.3

    Suppose that a car is described by its color. What scale could be used for color? Create five terms for color and sketch MFs for each term.

  4. 2.4

    Establish MFs for:

    1. (a)

      real numbers close to 10

    2. (b)

      real numbers approximately equal to 6

    3. (c)

      integers very far from 10

    4. (d)

      complex numbers near the origin

    5. (e)

      light (weight)

    6. (f)

      heavy (weight).

  5. 2.5

    List six linguistic variables from the field of acoustics (or any field that is of interest to you).

  6. 2.6

    Using the rules in Example 2.5 as illustrations, list four more rules and their associated MFs.

  7. 2.7

    Let X be the set of all men and Y be the set of all women. Consider the linguistic variable “weight,” and the set of terms {very skinny, skinny, just right, heavy, very heavy}. Create MFs for these terms for both men and women.

  8. 2.8

    Consider the judgments listed here, and assume that they can be mapped onto an interval scale ranging from 0 to 10. Define five fuzzy sets for each of them and sketch what you feel are appropriate MFs for them.

    1. (a)

      touching

    2. (b)

      eye contact

    3. (c)

      smiling

    4. (d)

      acting witty

    5. (e)

      flirtation.

  9. 2.9

    Western logic and thinking has been dominated for the most part by the Aristotelian laws of contradiction and the excluded middle . Eastern thinking has not. Eastern religions and concepts such as the Yin and the Yang (female and male/opposite forces) have caused some to speculate that this is why China and Japan were more receptive to fuzzy logic than were people in the West. For example, it’s possible for each of you to reside in Yin and Yang simultaneously, but to different degrees. Explain this in terms of fuzzy sets.

  10. 2.10

    Prove that, for crisp sets A and B, \( \hbox{min} [\mu_{A} (x),\mu_{B} (x)] \) provides the correct MF for intersection , given in (2.12).

  11. 2.11

    For crisp sets A and B, prove the:

    1. (a)

      commutative law

    2. (b)

      associative laws

    3. (c)

      distributive laws

    4. (d)

      De Morgan’s laws.

  12. 2.12

    Consider three fuzzy sets, A, B, and C, whose MFs are (unnormalized) Gaussians, i.e., \( \mu_{A} (x) = \exp \left[ { - \tfrac{1}{2}(x - 3)^{2} } \right] \), \( \mu_{B} (x) = \exp \left[ { - \tfrac{1}{2}(x - 4)^{2} } \right] \) and \( \mu_{C} (x) = \exp \left[ { - \tfrac{1}{2}(x - 6)^{2} } \right] \). Sketch each of the following:

    1. (a)
      $$ \mu_{A \cap B \cap C} (x) $$
    1. (b)
      $$ \mu_{A \cup B \cup C} (x) $$
    1. (c)
      $$ \mu_{(A \cup B) \cap C} (x){\text{ and }}\mu_{A \cup (B \cap C)} (x) $$
    1. (d)
      $$ \mu_{(A \cap B) \cup C} (x){\text{ and }}\mu_{A \cap (B \cup C)} (x) $$
    1. (e)
      $$ \mu_{{\overline{A \cup B \cup C} }} (x). $$
  13. 2.13

    Consider the fuzzy sets A and B, where \( \mu_{A} (x) = \exp \left[ { - \tfrac{1}{2}(x - 3)^{2} } \right] \) and \( \mu_{B} (x) = \exp \left[ { - \tfrac{1}{2}(x - 4)^{2} } \right] \).

    1. (a)

      Sketch \( \mu_{A \cup B} (x) \) for the following t-conorms: maximum, algebraic sum, bounded sum and drastic sum. Which t-conorm gives the largest and smallest values for \( \mu_{A \cup B} (x) \) ?

    2. (b)

      Sketch \( \mu_{A \cap B} (x) \) for the following t-norms: minimum, algebraic product, bounded product and drastic product. Which t-norm gives the largest and smallest values for \( \mu_{A \cap B} (x) \)?

  14. 2.14

    Using (2.34) and (2.35), show that \( \mu_{c \cup s} (u,v) \) and \( \mu_{c \cap s} (u,v) \) are given by (2.38) and (2.39), respectively.

  15. 2.15

    Verify the max-min and max-product composition of the crisp relations for the (3, 3) element of \( R_{3} (U,W) \) in (2.43).

  16. 2.16

    Consider the fuzzy relations “u is lighter than voru is about the same weight as v.” Assume that \( u \in U \) and \( v \in V \) where U and V are discrete universes of discourse, and U has four elements whereas V has six elements.

    1. (a)

      Pick U and V to use in the rest of this exercise.

    2. (b)

      Establish MFs for lighter and about the same, i.e., \( \mu_{l} (u,v) \) and \( \mu_{ats} (u,v) \), where the numbers in \( \mu_{l} (u,v) \) and \( \mu_{ats} (u,v) \) agree with a comparison of the numbers in U and V.

    3. (c)

      Compute \( \mu_{l \cup ats} (u,v) \).

  17. 2.17

    Perform all of the calculations needed to obtain \( \mu_{c \circ mb} (u,w) \) given in (2.54).

  18. 2.18

    Repeat Example 2.15 using the product t-norm. Compare these results with the ones given in (2.54) which were obtained using the minimum t-norm. Are they significantly different?

  19. 2.19

    Consider the fuzzy relation “u is lighter than v” on \( U \times V \), and the fuzzy relation “v is heavier than w” on \( V \times W \). Assume that U, V, and W are discrete universes of discourse, and U has four elements, V has six elements, and W has three elements.

    1. (a)

      Pick U, V, and W to use in the rest of this exercise.

    2. (b)

      Establish MFs for lighter and heavier, i.e., \( \mu_{l} (u,v) \) and \( \mu_{h} (v,w) \), where the numbers in \( \mu_{l} (u,v) \) and \( \mu_{h} (v,w) \) agree with a comparison of the numbers in U, V, and W.

    3. (c)

      Compute \( \mu_{l \circ h} (u,w) \) using minimum t-norm.

    4. (d)

      Compute \( \mu_{l \circ h} (u,w) \) using product t-norm.

    5. (e)

      Compare the results from (c) and (d).

  20. 2.20

    Consider the fuzzy relation “u is lighter than v” on \( U \times V \). Assume that U and V are discrete universes of discourse, and U has four elements and V has six elements.

    1. (a)

      Pick U and V to use in the rest of this exercise.

    2. (b)

      Establish a MF for lighter, i.e., \( \mu_{l} (u,v) \), where the numbers in \( \mu_{l} (u,v) \) agree with a comparison of the numbers in U and V.

    3. (c)

      Construct a MF for the fuzzy set skinny, \( \mu_{skinny} (u) \), on U.

    4. (d)

      Compute the composition of “u is skinny” andu is lighter than v”, \( \mu_{skinny \circ l} (v) \).

  21. 2.21

    Using the same universe of discourse as in Example 2.17, develop MFs for:

    1. (a)

      very likely

    2. (b)

      not-too-likely.

  22. 2.22

    Suppose that \( U = \{ - 5, - 4, - 3, - 2, - 1,0,1,2,3,4,5\} \) and fuzzy set A is characterized by the MF

    $$ \mu_{A} (x) = 0.2/ - 5 + 0.4/ - 4 + 0.4/ - 3 + 0.5/ - 2 + 0.5/ - 1 + 0.6/0 + 0.9/1 + 1/2 + 0.8/3 + 0.5/4 + 0.1/5 $$
    1. (a)

      Determine the MF for the fuzzy set B that is associated with \( \mu_{f(A)} (y) \) when \( y = f(x) = x^{3} + 2x^{2} \).

    2. (b)

      Determine the MF for the fuzzy set B that is associated with \( \mu_{f(A)} (y) \) when \( y = |x| \).

  23. 2.23

    Suppose that \( X_{1} = \{ 1,2,3,4\} \) and \( X_{2} = \{ - 1, - 2, - 3, - 4\} \), and fuzzy sets \( A_{1} \) and \( A_{2} \) are characterized by the following MFs:

    $$ \mu_{{A_{1} }}(x_{1} ) = 0.5/1 + 0.5/2 + 0/3 + 1/4{\text{ and }} \mu_{{A_{2} }}(x_{2} ) = 1/ - 1 + 0/ - 2 + 0.25/ - 3 + 0.5/ - 4 $$

    Determine the MF for the fuzzy set B that is associated with \( \mu_{{f(A_{1} A_{2} )}} (y) \), when \( y = f(x_{1} ,x_{2} ) = x_{1}^{2} - 2x_{2}^{2} \).

  24. 2.24

    Given the type-1 Gaussian fuzzy set \( F_{i} \), with mean \( m_{i} \) and standard deviation \( \sigma_{i} \), prove that \( a_{i} F_{i} + b \) is a Gaussian fuzzy set with mean \( a_{i} m_{i} + b \) and standard deviation \( \left| {a_{i} \sigma_{i} } \right| \). Note that this result does not depend on the kind of t-norm used, since \( a_{i} \) and \( b \) are crisp numbers.

  25. 2.25

    Given n type-1 Gaussian fuzzy sets \( F_{1} , \ldots ,F_{n} \), with means \( m_{1} ,\ldots,m_{n} \) and standard deviations \( \sigma_{1} , \ldots \sigma_{n} \), as in (2.77), prove that \( \sum\nolimits_{i = 1}^{n} {F_{i} } \) is a Gaussian fuzzy set with mean \( \sum\nolimits_{i = 1}^{n} {m_{i} } \) and standard deviation \( \Sigma^{\prime \prime} \), where

    $$ \Sigma^{\prime \prime } = \left\{ {\begin{array}{*{20}l} {\sqrt {\sum\nolimits_{i = 1}^{n} {\sigma_{i}^{2} } } } & {{\text{if product t}} {\text{-}} {\text{norm is used}}} \\ {\sum\nolimits_{{i{ = }1}}^{n} {\sigma_{i} } } & {{\text{if minimum t}} {\text{-}} {\text{norm is used}}} \\ \end{array} } \right. $$

    [Hints: (1) First prove the results for two sets and then for three sets; (2) show that the supremum of the minimum of two Gaussians is reached at their point of intersection lying between their means.]

  26. 2.26

    Complete part (b) in the proof of Example 2.21.

  27. 2.27

    In Example 2.22, obtain the comparable results when \( a_{i} \) are positive or negative real numbers.

  28. 2.28

    Prove (2.81).

  29. 2.29

    Repeat Example 2.28 but now for \( \mu_{A \cap B} (x) \).

  30. 2.30

    LetFootnote 35 \( X_{i} (i = 1, \ldots ,n) \) be fuzzy sets with Gaussian MFs, \( \mu_{{X_{i} }} (x_{i} ) = \exp \left( { - {{[(x_{i} - c_{i} )/\sigma_{i} ]^{2} } \mathord{\left/ {\vphantom {{[(x_{i} - c_{i} )/\sigma_{i} ]^{2} } 2}} \right. \kern-0pt} 2}} \right) \), and \( w_{i} \ge 0 \) be constant weights with \( \sum\nolimits_{i = 1}^{n} {w_{i} } = 1 \). Using the Extension Principle with the minimum t-norm, prove that \( Y_{n} = \sum\nolimits_{i = 1}^{n} {w_{i} X_{i} } \) is a fuzzy set with MF \( \mu_{{Y_{n} }} (y_{n} ) = \exp \left( { - {{\left[ {y_{n} - \sum\nolimits_{i = 1}^{n} {w_{i} c_{i} } } \right]^{2} } \mathord{\left/ {\vphantom {{\left[ {y_{n} - \sum\nolimits_{i = 1}^{n} {w_{i} c_{i} } } \right]^{2} } {\left[ {\sum\nolimits_{i = 1}^{n} {w_{i} \sigma_{i} } } \right]^{2} }}} \right. \kern-0pt} {\left[ {\sum\nolimits_{i = 1}^{n} {w_{i} \sigma_{i} } } \right]^{2} }}} \right) \). [Hint: Prove this by using mathematical induction.]

  31. 2.31

    LetFootnote 36 \( A = [a,b,c] \) and \( B = [p,q,r] \) be two triangle type-1 fuzzy numbers with MF given in (2.103) and (2.104), respectively. Compute the MF of:

    1. (a)
      $$ A - B $$
    1. (b)
      $$ \exp (A) $$
    1. (c)
      $$ \ln (A) $$
    1. (d)
      $$ \sqrt A $$
    1. (e)
      $$ (A)^{1/n}. $$
  32. 2.32

    LetFootnote 37 \( A = [a,b,c] \) and \( B = [p,q,r] \) be two positive triangle type-1 fuzzy numbers with MF given in (2.103) and (2.104), respectively. Compute the MF of:

    1. (a)
      $$ A \cdot B $$
    2. (b)
      $$ A \div B $$
    3. (c)
      $$ (A)^{ - 1}. $$
  33. 2.33

    For the non-normal type-1 trapezoidal fuzzy number , \( A_{i} = (a_{i} ,b_{i} ,c_{i} ,d_{i} ;w_{i} ) \), whose MF is depicted in Fig. 2.21, prove that (Wei and Chen 2009):

    Fig. 2.21
    figure 21

    Type-1 trapezoidal fuzzy number for Exercise 2.33

    1. (a)

      \( A_{1} + A_{2} = (a_{1} + a_{2} ,b_{1} + b_{2} ,c_{1} + c_{2} ,d_{1} + d_{2} ;\hbox{min} (w_{1} ,w_{2} )), \) where \( a_{i} \), \( b_{i} \), \( c_{i} \) and \( d_{i} \) are real numbers.

    2. (b)

      \( A_{1} - A_{2} = (a_{1} - d_{2} ,b_{1} - c_{2} ,c_{1} - b_{2} ,d_{1} - a_{2} ;\hbox{min} (w_{1} ,w_{2} )) \), where \( a_{i} \), \( b_{i} \), \( c_{i} \) and \( d_{i} \) are real numbers.

    3. (c)

      \( A_{1} \cdot A_{2} \approx (a_{1} \times a_{2} ,b_{1} \times b_{2} ,c_{1} \times c_{2} ,d_{1} \times d_{2} ;\hbox{min} (w_{1} ,w_{2} )) \), where \( a_{i} \), \( b_{i} \), \( c_{i} \) and \( d_{i} \) are positive real numbers.

    4. (d)

      \( A_{1} /A_{2} \approx (a_{1} /d_{2} ,b_{1} /c_{2} ,c_{1} /b_{2} ,d_{1} /a_{2} ;\hbox{min} (w_{1} ,w_{2} )) \), where \( a_{i} \), \( b_{i} \), \( c_{i} \) and \( d_{i} \) are non-zero positive real numbers.

    In (c) and (d), ≈ means that the result is a convex type-1 fuzzy set, as in (2.7), in which g(x) and h(x) are not straight lines.

  34. 2.34

    Using truth tables show that the following are tautologies [3]:

    1. (a)
      $$ p \wedge (q \vee r) \leftrightarrow (p \wedge q) \vee (p \wedge r) $$
    2. (b)
      $$ p \vee (q \wedge r) \leftrightarrow (p \vee q) \wedge (p \vee r) $$
    3. (c)
      $$ p \wedge (q \wedge r) \leftrightarrow (p \wedge q) \wedge r $$
    4. (d)
      $$ p \vee (q \vee r) \leftrightarrow (p \vee q) \vee r $$
  35. 2.35

    Use truth tables to determine whether or not the following propositions are tautologies:

    1. (a)
      $$ (p \wedge q) \to (p \vee q) $$
    2. (b)
      $$ \left[ {(p \to q) \wedge (r \to s) \wedge (p \vee r)} \right] \to (q \vee s) $$
    3. (c)
      $$ \left( {(p \wedge q) \to r} \right) \leftrightarrow (p \to r) \vee (q \to r) $$
  36. 2.36

    Prove that \( [(A \wedge C) \to D] \wedge [(B \wedge C) \to D] \leftrightarrow [(A \vee B) \wedge C \to D] \)[Hint: \( (p \to q) \leftrightarrow ( \sim p) \vee q \)].

  37. 2.37

    Validate the truth of the crisp implication MFs given in (2.122) and (2.123).

  38. 2.38

    Repeat Example 2.32 for the following implication MFs, and indicate which of these has a bias in its output:

    1. (a)

      Kleene-Dienes in (2.121)

    2. (b)

      Reichenbach in (2.122)

    3. (c)
      $$ {{\rm G\ddot{o}del}}: \mu_{A \to B}^{G} (x^{\prime } ,y) = \left\{ {\begin{array}{*{20}l} 1 \hfill & {\mu_{\text{A}} (x^{\prime } ) \le \mu_{B} (y)} \hfill \\ {\mu_{\text{B}} (y)} \hfill & {\mu_{A} (x^{\prime } ) > \mu_{B} (y)} \hfill \\ \end{array} } \right. $$
    4. (d)
      $$ {\text{Gaines Resher: }}\mu_{A \to B}^{GR} (x^{\prime},y) = \left\{ {\begin{array}{*{20}c} 1 & {\mu_{A} (x^{\prime}) \le \mu_{B} (y)} \\ 0 & {\mu_{A} (x^{\prime}) > \mu_{B} (y)} \\ \end{array} } \right. $$
  39. 2.39
    1. (a)

      For the upward sloping lines in Fig. 2.22a, show that the sup-min composition between the lines and the triangle always occurs at the intersection of the line and the right-hand leg of the triangle.

      Fig. 2.22
      figure 22

      Type-1 fuzzy sets for Exercise 2.39

    2. (b)

      For the downward sloping lines in Fig. 2.22b, show that the sup-min composition between the lines and the triangle always occurs at the intersection of the line and the left-hand leg of the triangle.

  40. 2.40

    Everything is the same as in Example 2.34, except that in this exercise minimum implication and minimum t-norm are used.

    1. (a)

      Show that, in this case, the sup-star composition in (2.127) can be expressed as

      $$ \mu_{{B^{ * } }} (y) = \hbox{min} \left[ {\sup_{x \in X} [\hbox{min} [\mu_{{A^{ * } }} (x),\mu_{A} (x)]],\mu_{B} (y)} \right] $$
    2. (b)

      Show that \( \sup_{x \in X} [\hbox{min} [\mu_{{A^{ * } }} (x),\mu_{A} (x)]] \) occurs at the intersection point of the two Gaussian MFs, namely at

      $$ x = x_{\hbox{max} } = {{(\sigma_{{A^{ * } }}^{{}} m_{A} + \sigma_{A}^{{}} x^{\prime } )} \mathord{\left/ {\vphantom {{(\sigma_{{A^{ * } }}^{{}} m_{A} + \sigma_{A}^{{}} x^{\prime } )} {(\sigma_{{A^{ * } }}^{{}} + \sigma_{A}^{{}} )}}} \right. \kern-0pt} {(\sigma_{{A^{ * } }}^{{}} + \sigma_{A}^{{}} )}} . $$
    3. (c)

      If possible, obtain a formula for \( \sup_{x \in X} [\hbox{min} [\mu_{{A^{ * } }} (x),\mu_{A} (x)]] \).

    4. (d)

      Assume a Gaussian consequent MF \( \mu_{B} (y) \). Sketch the fired-rule MF \( \mu_{{B^{ * } }} (y) \). How is this obtained directly from sketches of \( \mu_{{A^{ * } }} (x) \), \( \mu_{A} (x) \) and \( \mu_{B} (y) \)?

    5. (e)

      Repeat part (d) for a triangular consequent MF.

    6. (f)

      Compare the result in part (e) with the result in Fig. 2.19.

  41. 2.41

    Show that for type-1 fuzzy sets all the set-theoretic laws that are in Table 2.8 are satisfied under maximum t-conorm and minimum t-norm.

  42. 2.42

    Verify (2.153) and (2.154) numerically.

  43. 2.43

    As one knows, crisp set A can be defined by using its MF in (2.1). The number of elements that are in A is called its cardinality. So, for a crisp set its cardinality can be obtained by summing all of its MF values. Using this ideaFootnote 38, one can also define the cardinality of a type-1 fuzzy se t A, \( |A| \), analogously (De Luca and Termini 1972), i.e. for a discrete universe, \( |A| = \sum\nolimits_{i = 1}^{N} {\mu_{A} (x_{i} )} \), and for a continuous universe, \( |A| = \int_{X} {\mu_{A} (x)dx} \). Observe that \( |A| \) increases as N increases, and \( \lim_{N \to \infty } \sum\nolimits_{i = 1}^{N} {\mu_{A} (x_{i} )} \) does not exist. Wu and Mendel (2007) handle this by defining a normalized cardinality , \( p(A) \), for a type-1 fuzzy set in which DeLuca and Termini’s cardinality definition for continuous universes \( |A| = \int_{X} {\mu_{A} (x)dx} \), is discretized, i.e.: \( p(A) \equiv \frac{|X|}{N}\sum\nolimits_{i = 1}^{N} {\mu_{A} (x_{i} )} \), where \( |X| = x_{N} - x_{1} \) is the length of the universe of discourse used in the computation. X can be part of the complete universe of discourse because for some MFs (e.g., Gaussian, Bell) the complete universes of discourse are infinite. Usually \( x_{i} \) \( (i = 1,\ldots,N) \) are chosen equally spaced in the domain of \( x_{i} \); in this case, \( p(A) \) converges to its continuous version, \( \int_{X} {\mu_{A} (x)dx} \) as N increases.

    1. (a)

      Compute \( |A| \) for the triangle and trapezoidal type-1 fuzzy sets that are in Table 2.3.

    2. (b)

      Compute \( p(A) \) for the same MFs used in (a) for \( N = 10, 50, 100 \), and compare these results with \( |A| \).

  44. 2.44

    Similarity is sometimes used in a rule-based fuzzy system, so this exercise explores similarity for type-1 fuzzy sets. Similarity is about set equality. Two crisp sets A and B are equal if they contain exactly the same elements. In crisp set theory either two sets are equal or they are different. For fuzzy sets one knows that everything is a matter of degree; thus for two type-1 fuzzy sets A and B, it is reasonable to define a degree of similarity. As usual (in this book), crisp sets are our starting point.

As is stated in Nguyen and Kreinovich (2008): It is known that for two crisp sets A and B: (1) \( A \cap B \subseteq A \cup B \) (create a Venn diagram to convince yourself of the truth of this), and (2) \( A = B \) iff \( A \cap B = A \cup B \). So, for crisp sets, to check whether \( A = B \) consider the ratio \( |A \cap B|/|A \cup B| \) where \( | \centerdot | \) denotes the cardinality of \( \centerdot \) (see Exercise 2.43 about cardinality). In general this ratio is between 0 and 1; the smaller the ratio, the more there are elements from \( A \cup B \) which are not part of \( A \cap B \), and thus elements from one of the sets A and B that do not belong to the other of these two sets. Thus, for crisp sets, this ratio can be viewed as a reasonable measure of degree to which A is equal to B.

Because there are many definitions of cardinality for a type-1 fuzzy set, and because there can be many ways to define the similarity between two type-1 fuzzy sets (Mendel and Wu 2010 mention that there are at least 50 reported expressions for determining how similar two type-1 fuzzy sets are), this exercise focuses on what is arguably the most popular and useful definition of similarity, the so-called Jaccard similarity measure , named after P. Jaccard (Jaccard 1908), who is credited with such a formula.Footnote 39 The Jaccard similarity measure, \( sm_{J} (A,B) \), for type-1 fuzzy sets A and B, is: \( sm_{J} (A,B) = f(A \cap B)/f(A \cup B) \). Usually, function f is chosen as the cardinality where \( \cap = \hbox{min} \) and \( \cup = \hbox{max} \). For a continuous universe of discourse:

$$ sm_{J} (A,B) = \frac{|A \cap B|}{|A \cup B|} = \frac{{\int_{X} {\hbox{min} \left( {\mu_{A} (x),\mu_{B} (x)} \right)dx} }}{{\int_{X} {\hbox{max} \left( {\mu_{A} (x),\mu_{B} (x)} \right)dx} }} $$
  1. (a)

    What is the formula for \( sm_{J} (A,B) \) for discrete universes of discourse?

  2. (b)

    Compute \( sm_{J} (A,B) \) for the two type-1 fuzzy sets that are depicted in Fig. 2.23a.

    Fig. 2.23
    figure 23

    Two type-1 fuzzy sets, A and B, for Exercise 2.44

  3. (c)

    Compute \( sm_{J} (A,B) \) for the two type-1 fuzzy sets that are depicted in Fig. 2.23b.

  1. 2.45

    Subsethood is also sometimes used in a rule-based fuzzy system, so this exercise explores subsethood for type-1 fuzzy sets. Subsethood is about set containment. Containment is dependent on the order of the two sets, A and B, i.e. A can be contained in B but B does not have to be contained in A, e.g. when \( A = \{ 1,2,3\} \) and \( B = \{ 1,2,3,4,5,6\} \), \( A \subset B \) but \( B \not\subset A \). For crisp sets , it is only when \( A = B \) that A is contained in B and B is contained in A. For fuzzy sets one knows that everything is a matter of degree; thus, for two type-1 fuzzy sets A and B, it is reasonable to define a degree of subsethood. As usual (in this book), crisp sets are our starting point.

As is stated in Nguyen and Kreinovich (2008): It is known that for two crisp sets A and B: (1) \( A \cap B \subseteq A \) and (2) \( A \subseteq B \) iff \( A \cap B = A \) (create Venn diagrams to convince yourself of the truth of these). So, for crisp sets, to check whether A is a subset of B consider the ratio \( |A \cap B|/|A| \) where \( | \centerdot | \) denotes the cardinality of \( \centerdot \) (see Exercise 2.43 about cardinality). In general this ratio is between 0 and 1, and it equals 1 if and only if A is a subset of B. The smaller the ratio the more there are elements from A which are not part of the intersection \( A \cap B \) and thus not part of set B. Consequently, for crisp sets, this ratio can be viewed as a reasonable measure of the degree to which A is a subset of B (see, also, Kosko 1990, 1992).

Because there are many definitions of cardinality for a type-1 fuzzy set as well as the intersection of two type-1 fuzzy sets, there can be many ways to define the subsethoodFootnote 40 between two type-1 fuzzy sets. This exercise focuses on what is arguably the most widely used definition of subsethood due to Kosko (1990) and denoted here as \( ss_{K} (A,B) \). For a continuous universe of discourse,

$$ ss_{K} (A,B) = \frac{{\int\nolimits_{X} {\hbox{min} (\mu_{A} (x),\mu_{B} (x))dx} }}{{\int\nolimits_{X} {\mu_{A} (x)dx} }} $$
  1. (a)

    Explain why \( ss_{K} (A,B) \ne ss_{K} (B,A) \).

  2. (b)

    What is the formula for \( ss_{K} (A,B) \) for discrete universes of discourse?

  3. (c)

    Compute \( ss_{K} (A,B) \) for the two type-1 fuzzy sets that are depicted in Fig. 2.23a.

  4. (d)

    Compute \( ss_{K} (A,B) \) for the two type-1 fuzzy sets that are depicted in Fig. 2.23b.

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this chapter

Cite this chapter

Mendel, J.M. (2017). Type-1 Fuzzy Sets and Fuzzy Logic. In: Uncertain Rule-Based Fuzzy Systems. Springer, Cham. https://doi.org/10.1007/978-3-319-51370-6_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-51370-6_2

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-51369-0

  • Online ISBN: 978-3-319-51370-6

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics