Difference Between Fuzzy Set and Crisp Set

Fuzzy set and crisp set are the part of the distinct set theories, where the fuzzy set implements
infinite-valued logic while crisp set employs bi-valued logic. Previously, expert system
principles were formulated premised on Boolean logic where crisp sets are used. But then
scientists argued that human thinking does not always follow crisp “yes”/”no” logic, and it
could be vague, qualitative, uncertain, imprecise or fuzzy in nature. This gave
commencement to the development of the fuzzy set theory to imitate human thinking.

For an element in a universe, that comprise fuzzy sets can have a progressive transition
among several degrees of membership. While in crisp sets the transition for an element in the
universe between membership and non-membership in a given set is sudden and well defined.

Content: Fuzzy Set Vs Crisp Set

1.
1. Comparison Chart
2. Definition
3. Key Differences
4. Conclusion

Comparison Chart
 BASIS FOR
FUZZY SET CRISP SET
COMPARISON

Basic Prescribed by vague or ambiguous Defined by precise and certain

properties. characteristics.

Property Elements are allowed to be partially Element is either the member of a

included in the set. set or not.

Applications Used in fuzzy controllers Digital design

Logic Infinite-valued bi-valued

Definition of Fuzzy Set

A fuzzy set is a combination of the elements having a changing degree of membership in the
set. Here “fuzzy” means vagueness, in other words, the transition among various degrees of
the membership complies that the limits of the fuzzy sets are vague and ambiguous.
Therefore, the membership of the elements from the universe in the set is measured against a
function to identify the uncertainty and ambiguity.

A fuzzy set is denoted by a text having tilde under strike. Now, a fuzzy set X would contain
all the possible outcome from interval 0 to 1. Suppose a is an element in the universe is a
member of fuzzy set X, the function gives the mapping by X(a) = [0,1]. The notion
convention used for fuzzy sets when the universe of discourse U (set of input values for the
fuzzy set X) is discrete and finite, for fuzzy set X is given by:

The fuzzy set theory

was initially proposed by a computer scientist Lotfi A. Zadeh in the year of 1965. After that
lot of theoretical development has been done in a similar field. Previously the theory of crisp
sets based in dual logic is used in the computing and formal reasoning which involves the
solutions in either of two form such as “yes or no” and “true or false”.
Fuzzy logic

Unlike crisp logic, in fuzzy logic, approximate human reasoning capabilities are added in
order to apply it to the knowledge-based systems. But, what was the need to develop such a
theory? The fuzzy logic theory provides a mathematical method to apprehend the
uncertainties related to the human cognitive process, for example, thinking and reasoning and
it can also handle the issue of uncertainty and lexical imprecision.

Example

Let’s take an example to understand fuzzy logic. Suppose we need to find whether the colour
of the object is blue or not. But the object can have any of the shade of blue depending on the
intensity of the primary colour. So, the answer would vary accordingly, such as royal blue,
navy blue, sky blue, turquoise blue, azure blue, and so on. We are assigning the darkest shade
of blue a value 1 and 0 to the white colour at the lowest end of the spectrum of values. Then
the other shades will range in 0 to 1 according to intensities. Therefore, this kind of situation
where any of the values can be accepted in a range of 0 to 1 is termed as fuzzy.

Definition of Crisp Set

The crisp set is a collection of objects (say U) having identical properties such as countability
and finiteness. A crisp set ‘B’ can be defined as a group of elements over the universal set U,
where a random element can be a part of B or not. Which means there are only two possible
ways, first is the element could belong to set B or it does not belong to set B. The notation to
define the crisp set B containing a group of some elements in U having the same property P,
is given below.

It can perform operations like union, intersection, compliment and difference. The properties
exhibited in the crisp set includes commutativity, distributivity, idempotency, associativity,
identity, transitivity and involution. Though, fuzzy sets also have the same above given
properties.

Crisp Logic

The traditional approach (crisp logic) of knowledge representation does not provide an
appropriate way to interpret the imprecise and non-categorical data. As its functions are based
on the first order logic and classical probability theory. In another way, it can not deal with
the representation of human intelligence.

Example
Now, let’s understand the crisp logic by an example. We are supposed to find the answer to
the question, Does she have a pen? The answer of the above-given question is definite Yes or
No, depending on the situation. If yes is assigned a value 1 and No is assigned a 0, the
outcome of the statement could have a 0 or 1. So, a logic which demands a binary (0/1) type
of handling is known as Crisp logic in the field of fuzzy set theory.

Key Differences Between Fuzzy Set and Crisp Set

1. A fuzzy set is determined by its indeterminate boundaries, there exists an uncertainty

about the set boundaries. On the other hand, a crisp set is defined by crisp boundaries,
and contain the precise location of the set boundaries.
2. Fuzzy set elements are permitted to be partly accommodated by the set (exhibiting
gradual membership degrees). Conversely, crisp set elements can have a total
membership or non-membership.
3. There are several applications of the crisp and fuzzy set theory, but both are driven
towards the development of the efficient expert systems.
4. The fuzzy set follows the infinite-valued logic whereas a crisp set is based on bi-valued
logic.

Difference Between Fuzzification and Defuzzification

Fuzzification and defuzzification are the fuzzy inferencing system steps where the
fuzzification translates the precise quantity as a fuzzy quantity whereas defuzzification
converts the fuzzy quantity into a crisp one. The techniques are very useful in the fuzzy
inference process, where the mapping is developed from a given input to an output with the
help of fuzzy logic. This mapping provides the base for making the decision and discovering
patterns.

The fuzzy inference process is consist of the step – Fuzzification, Rule evaluation and
Defuzzification among which we are going to understand the difference between
fuzzification and defuzzification.
Content: Fuzzification and Defuzzification

1.
1. Comparison Chart
2. Definition
3. Key Differences
4. Conclusion

Comparison Chart

BASIS FOR
FUZZIFICATION DEFUZZIFICATION
COMPARISON

Basic Precise data is converted into Imprecise data is converted into precise

imprecise data. data.

Methods Intuition, inference, rank Maximum membership principle, centroid

ordering, angular fuzzy sets, method, weighted average method, center

neural network, etcetera. of sums, etcetera.

Example Voltmeter Stepper motor and D/A converter

Complexity Quite simple Complicated

Definition of Fuzzification

Fuzzification is the method of converting a crisp quantity into a fuzzy quantity. This is
achieved by recognizing the various assumed crisp and deterministic quantities as completely
nondeterministic and quite uncertain in nature. The uncertainty might have emerged due to
vagueness and imprecision which lead the variables to be represented by a membership
function as they could be fuzzy in nature. The process translates accurate crisp input values
into linguistic variables represented by fuzzy sets. Then it applies membership functions to
the measurements and determines the degree of membership.

Let’s understand this by a practical example of a voltmeter which produces a crisp data but
these data can generate an experimental error. The below-given figure shows the associated
member function for a probable range of errors for a typical voltage reading.
 For example, when a news reporter says the temperature is 40° Celsius the viewer
converts the crisp input value into a linguistic variable like favourable temperature for the
human body, hot or cold and then decides what to wear. One the same hand, if someone is
not able to fuzzify, then it is not possible to continue the decision process, or error decision
may occur.

Definition of Defuzzification

Defuzzification is the inverse process of fuzzification where the mapping is done to convert
the fuzzy results into crisp results. It maps from a space of fuzzy control actions defined over
an output universe of discourse into a space of crisp (nonfuzzy) control actions. The necessity
of the defuzzification was arisen due to crisp control actions in some practical
implementation are needed to operate the control.

The process is able to generate a nonfuzzy control action that illustrates the possibility
distribution of an inferred fuzzy control action. Defuzzification process can be considered as
the rounding off process, where fuzzy set with a group of membership values on the unit
interval may be decreased to a single scalar quantity. The reason behind this are the situations
that occur when the outcome of the fuzzy process requires to be a single scalar quantity as
restrained to a fuzzy set.
Key Differences Between Fuzzification and Defuzzification

1. Fuzzification is the method of transforming crisp values into fuzzy values (imprecise).
In contrast, defuzzification is just opposite to fuzzification where the fuzzy values are
converted into precise or crisp data.
2. Fuzzification is simpler than defuzzification, comparatively.

Membership function
Definition: A graph that defines how each point in the input space is mapped to
membership value between 0 and 1. Input space is often referred to as the universe of
discourse or universal set (u), which contains all the possible elements of concern in each
particular application.
There are largely three types of fuzzifiers:
 Singleton fuzzifier
 Gaussian fuzzifier
 Trapezoidal or triangular fuzzifier
What is Fuzzy Control?
 It is a technique to embody human-like thinkings into a control system.
 It may not be designed to give accurate reasoning but it is designed to give acceptable
reasoning.
 It can emulate human deductive thinking, that is, the process people use to infer
conclusions from what they know.
 Any uncertainties can be easily dealt with the help of fuzzy logic.
Advantages of Fuzzy Logic System
 This system can work with any type of inputs whether it is imprecise, distorted or noisy
input information.
 The construction of Fuzzy Logic Systems is easy and understandable.
 Fuzzy logic comes with mathematical concepts of set theory and the reasoning of that is
quite simple.
 It provides a very efficient solution to complex problems in all fields of life as it
resembles human reasoning and decision-making.
 The algorithms can be described with little data, so little memory is required.
Disadvantages of Fuzzy Logic Systems
 Many researchers proposed different ways to solve a given problem through fuzzy logic
which leads to ambiguity. There is no systematic approach to solve a given problem
through fuzzy logic.
 Proof of its characteristics is difficult or impossible in most cases because every time
we do not get a mathematical description of our approach.
 As fuzzy logic works on precise as well as imprecise data so most of the time accuracy
is compromised.
Application
 It is used in the aerospace field for altitude control of spacecraft and satellites.
 It has been used in the automotive system for speed control, traffic control.
 It is used for decision-making support systems and personal evaluation in the large
company business.
 It has application in the chemical industry for controlling the pH, drying, chemical
distillation process.
 Fuzzy logic is used in Natural language processing and various intensive applications in
Artificial Intelligence.
 Fuzzy logic is extensively used in modern control systems such as expert systems.
 Fuzzy Logic is used with Neural Networks as it mimics how a person would make
decisions, only much faster. It is done by Aggregation of data and changing it into more
meaningful data by forming partial truths as Fuzzy sets.

 Predicate Logic
 This logic deals with predicates, which are propositions containing variables.
 A predicate is an expression of one or more variables defined on some specific domain.
A predicate with variables can be made a proposition by either assigning a value to the
variable or by quantifying the variable.
 Following are a few examples of predicates −
 Let E(x, y) denote "x = y"
 Let X(a, b, c) denote "a + b + c = 0"
 Let M(x, y) denote "x is married to y"
 Propositional Logic
 A proposition is a collection of declarative statements that have either a truth value
"true” or a truth value "false". A propositional consists of propositional variables and
connectives. The propositional variables are dented by capital letters (A, B, etc). The
connectives connect the propositional variables.
 A few examples of Propositions are given below −
 "Man is Mortal", it returns truth value “TRUE”
 "12 + 9 = 3 – 2", it returns truth value “FALSE”
 The following is not a Proposition −
 "A is less than 2" − It is because unless we give a specific value of A, we cannot say
whether the statement is true or false.
 Connectives
 In propositional logic, we use the following five connectives −
 OR (∨∨)
 AND (∧∧)
 Negation/ NOT (¬¬)
 Implication / if-then (→→)
 If and only if (⇔⇔)
 OR (∨∨)
 The OR operation of two propositions A and B (written as A∨BA∨B) is true if at least
any of the propositional variable A or B is true.
 The truth table is as follows −
  A  B  A∨B

 True  True  True

 True  False  True

 False  True  True

 False  False  False

 AND (∧∧)
 The AND operation of two propositions A and B (written as A∧BA∧B) is true if both
the propositional variable A and B is true.
 The truth table is as follows −
 A  B  A∧B

 True  True  True

 True  False  False

 False  True  False

 False  False  False

 Negation (¬¬)
 The negation of a proposition A (written as ¬A¬A) is false when A is true and is true
when A is false.
 The truth table is as follows −
 A  ¬A

 True  False

 False  True
 Implication / if-then (→→)
 An implication A→BA→B is the proposition “if A, then B”. It is false if A is true and
B is false. The rest cases are true.
 The truth table is as follows −
 A  B  A→B

 True  True  True

 True  False  False

 False  True  True

 False  False  True

 If and only if (⇔⇔)
 A⇔BA⇔B is a bi-conditional logical connective which is true when p and q are same,
i.e., both are false or both are true.
 The truth table is as follows −
  A  B  A⇔B

 True  True  True

 True  False  False

 False  True  False

 False  False  True

 Well Formed Formula
 Well Formed Formula (wff) is a predicate holding one of the following −
 All propositional constants and propositional variables are wffs.
 If x is a variable and Y is a wff, ∀xY and ∃xY are also wff.
 Truth value and false values are wffs.
 Each atomic formula is a wff.
 All connectives connecting wffs are wffs.
 Quantifiers
 The variable of predicates is quantified by quantifiers. There are two types of quantifier
in predicate logic −
 Universal Quantifier
 Existential Quantifier
 Universal Quantifier
 Universal quantifier states that the statements within its scope are true for every value
of the specific variable. It is denoted by the symbol ∀.
 ∀xP(x) is read as for every value of x, P(x) is true.
 Example − "Man is mortal" can be transformed into the propositional form ∀xP(x).
Here, P(x) is the predicate which denotes that x is mortal and the universe of discourse
is all men.
 Existential Quantifier
 Existential quantifier states that the statements within its scope are true for some values
of the specific variable. It is denoted by the symbol ∃.
 ∃xP(x) for some values of x is read as, P(x) is true.
 Example − "Some people are dishonest" can be transformed into the propositional form
∃x P(x) where P(x) is the predicate which denotes x is dishonest and the universe of
discourse is some people.
 Nested Quantifiers
 If we use a quantifier that appears within the scope of another quantifier, it is called a
nested quantifier.
 Example
 ∀ a∃bP(x,y) where P(a,b) denotes a+b = 0
 ∀ a∀b∀cP(a,b,c) where P(a,b) denotes a+(b+c) = (a+b)+c
 Note − ∀a∃bP(x,y) ≠ ∃a∀bP(x,y)
 Fuzzy Logic - Approximate Reasoning
 Following are the different modes of approximate reasoning −
 Categorical Reasoning
 In this mode of approximate reasoning, the antecedents, containing no fuzzy quantifiers
and fuzzy probabilities, are assumed to be in canonical form.
 Qualitative Reasoning
 In this mode of approximate reasoning, the antecedents and consequents have fuzzy
linguistic variables; the input-output relationship of a system is expressed as a
 collection of fuzzy IF-THEN rules. This reasoning is mainly used in control system
analysis.
 Syllogistic Reasoning
 In this mode of approximation reasoning, antecedents with fuzzy quantifiers are related
to inference rules. This is expressed as −
 x = S1A′s are B′s
 y = S2C′s are D′s
 ------------------------
 z = S3E′s are F′s
 Here A,B,C,D,E,F are fuzzy predicates.
 S1 and S2 are given fuzzy quantifiers.
 S3 is the fuzzy quantifier which has to be decided.
 Dispositional Reasoning
 In this mode of approximation reasoning, the antecedents are dispositions that may
contain the fuzzy quantifier “usually”. The quantifier Usually links together the
dispositional and syllogistic reasoning; hence it pays an important role.
 For example, the projection rule of inference in dispositional reasoning can be given as
follows −
 usually( (L,M) is R ) ⇒ usually (L is [R ↓ L])
 Here [R ↓ L] is the projection of fuzzy relation R on L
 Fuzzy Logic Rule Base
 It is a known fact that a human being is always comfortable making conversations in
natural language. The representation of human knowledge can be done with the help of
following natural language expression −
 IF antecedent THEN consequent
 The expression as stated above is referred to as the Fuzzy IF-THEN rule base.
 Canonical Form
 Following is the canonical form of Fuzzy Logic Rule Base −
 Rule 1 − If condition C1, then restriction R1
 Rule 2 − If condition C1, then restriction R2
 .
 .
 .
 Rule n − If condition C1, then restriction Rn
 Interpretations of Fuzzy IF-THEN Rules
 Fuzzy IF-THEN Rules can be interpreted in the following four forms −
 Assignment Statements
 These kinds of statements use “=” (equal to sign) for the purpose of assignment. They
are of the following form −
 a = hello
 climate = summer
 Conditional Statements
 These kinds of statements use the “IF-THEN” rule base form for the purpose of
condition. They are of the following form −
 IF temperature is high THEN Climate is hot
 IF food is fresh THEN eat.
 Unconditional Statements
 They are of the following form −
 GOTO 10
 turn the Fan off
 Linguistic Variable
 We have studied that fuzzy logic uses linguistic variables which are the words or
sentences in a natural language. For example, if we say temperature, it is a linguistic
variable; the values of which are very hot or cold, slightly hot or cold, very warm,
slightly warm, etc. The words very, slightly are the linguistic hedges.
 Characterization of Linguistic Variable
 Following four terms characterize the linguistic variable −
 Name of the variable, generally represented by x.
 Term set of the variable, generally represented by t(x).
 Syntactic rules for generating the values of the variable x.
 Semantic rules for linking every value of x and its significance.
 Propositions in Fuzzy Logic
 As we know that propositions are sentences expressed in any language which are
generally expressed in the following canonical form −
 s as P
 Here, s is the Subject and P is Predicate.
 For example, “Delhi is the capital of India”, this is a proposition where “Delhi” is the
subject and “is the capital of India” is the predicate which shows the property of
subject.
 We know that logic is the basis of reasoning and fuzzy logic extends the capability of
reasoning by using fuzzy predicates, fuzzy-predicate modifiers, fuzzy quantifiers and
fuzzy qualifiers in fuzzy propositions which creates the difference from classical logic.
 Propositions in fuzzy logic include the following −
 Fuzzy Predicate
 Almost every predicate in natural language is fuzzy in nature hence, fuzzy logic has the
predicates like tall, short, warm, hot, fast, etc.
 Fuzzy-predicate Modifiers
 We discussed linguistic hedges above; we also have many fuzzy-predicate modifiers
which act as hedges. They are very essential for producing the values of a linguistic
variable. For example, the words very, slightly are modifiers and the propositions can
be like “water is slightly hot.”
 Fuzzy Quantifiers
 It can be defined as a fuzzy number which gives a vague classification of the cardinality
of one or more fuzzy or non-fuzzy sets. It can be used to influence probability within
fuzzy logic. For example, the words many, most, frequently are used as fuzzy
quantifiers and the propositions can be like “most people are allergic to it.”
 Fuzzy Qualifiers
 Let us now understand Fuzzy Qualifiers. A Fuzzy Qualifier is also a proposition of
Fuzzy Logic. Fuzzy qualification has the following forms −
 Fuzzy Qualification Based on Truth
 It claims the degree of truth of a fuzzy proposition.
 Expression − It is expressed as x is t. Here, t is a fuzzy truth value.
 Example − (Car is black) is NOT VERY True.
 Fuzzy Qualification Based on Probability
 It claims the probability, either numerical or an interval, of fuzzy proposition.
 Expression − It is expressed as x is λ. Here, λ is a fuzzy probability.
 Example − (Car is black) is Likely.
 Fuzzy Qualification Based on Possibility
 It claims the possibility of fuzzy proposition.
 Expression − It is expressed as x is π. Here, π is a fuzzy possibility.
 Example − (Car is black) is Almost Impossible.
 Fuzzy Logic - Inference System
 Fuzzy Inference System is the key unit of a fuzzy logic system having decision making
as its primary work. It uses the “IF…THEN” rules along with connectors “OR” or
“AND” for drawing essential decision rules.
 Characteristics of Fuzzy Inference System
 Following are some characteristics of FIS −
 The output from FIS is always a fuzzy set irrespective of its input which can be fuzzy or
crisp.
 It is necessary to have fuzzy output when it is used as a controller.
 A defuzzification unit would be there with FIS to convert fuzzy variables into crisp
variables.
 Functional Blocks of FIS
 The following five functional blocks will help you understand the construction of FIS −
 Rule Base − It contains fuzzy IF-THEN rules.
 Database − It defines the membership functions of fuzzy sets used in fuzzy rules.
 Decision-making Unit − It performs operation on rules.
 Fuzzification Interface Unit − It converts the crisp quantities into fuzzy quantities.
 Defuzzification Interface Unit − It converts the fuzzy quantities into crisp quantities.
Following is a block diagram of fuzzy interference system.
Working of FIS

The working of the FIS consists of the following steps −

 A fuzzification unit supports the application of numerous fuzzification methods, and

converts the crisp input into fuzzy input.
 A knowledge base - collection of rule base and database is formed upon the
conversion of crisp input into fuzzy input.
 The defuzzification unit fuzzy input is finally converted into crisp output.
Methods of FIS

Let us now discuss the different methods of FIS. Following are the two important methods of
FIS, having different consequent of fuzzy rules −

 Mamdani Fuzzy Inference System

 Takagi-Sugeno Fuzzy Model (TS Method)
Mamdani Fuzzy Inference System

This system was proposed in 1975 by Ebhasim Mamdani. Basically, it was anticipated to
control a steam engine and boiler combination by synthesizing a set of fuzzy rules obtained
from people working on the system.

Steps for Computing the Output

Following steps need to be followed to compute the output from this FIS −

 Step 1 − Set of fuzzy rules need to be determined in this step.

 Step 2 − In this step, by using input membership function, the input would be made
fuzzy.
 Step 3 − Now establish the rule strength by combining the fuzzified inputs according
to fuzzy rules.
 Step 4 − In this step, determine the consequent of rule by combining the rule strength
and the output membership function.
 Step 5 − For getting output distribution combine all the consequents.
 Step 6 − Finally, a defuzzified output distribution is obtained.

Following is a block diagram of Mamdani Fuzzy Interface System.

 akagi-Sugeno Fuzzy Model (TS Method)

This model was proposed by Takagi, Sugeno and Kang in 1985. Format of this rule is given
as −

IF x is A and y is B THEN Z = f(x,y)

Here, AB are fuzzy sets in antecedents and z = f(x,y) is a crisp function in the consequent.

Fuzzy Inference Process

The fuzzy inference process under Takagi-Sugeno Fuzzy Model (TS Method) works in the
following way −

 Step 1: Fuzzifying the inputs − Here, the inputs of the system are made fuzzy.
 Step 2: Applying the fuzzy operator − In this step, the fuzzy operators must be applied
to get the output.

Rule Format of the Sugeno Form

The rule format of Sugeno form is given by −

if 7 = x and 9 = y then output is z = ax+by+c

Comparison between the two methods

Let us now understand the comparison between the Mamdani System and the Sugeno Model.
  Output Membership Function − The main difference between them is on the basis of
output membership function. The Sugeno output membership functions are either
linear or constant.
 Aggregation and Defuzzification Procedure − The difference between them also lies
in the consequence of fuzzy rules and due to the same their aggregation and
defuzzification procedure also differs.
 Mathematical Rules − More mathematical rules exist for the Sugeno rule than the
Mamdani rule.
 Adjustable Parameters − The Sugeno controller has more adjustable parameters than
the Mamdani controller.

Fuzzy Logic - Database and Queries

We have studied in our previous chapters that Fuzzy Logic is an approach to computing
based on "degrees of truth" rather than the usual "true or false" logic. It deals with reasoning
that is approximate rather than precise to solve problems in a way that more resembles human
logic, hence database querying process by the two valued realization of Boolean algebra is
not adequate.

Fuzzy Scenario of Relations on Databases

The Fuzzy Scenario of Relations on Databases can be understood with the help of the
following example −

Example

Suppose we have a database having the records of persons who visited India. In simple
database, we will have the entries made in the following way −

Visited Days Year of

Name Age Citizen
Country Spent Visit

John
35 U.S. India 41 1999
Smith

John
35 U.S. Italy 72 1999
Smith

John
35 U.S. Japan 31 1999
Smith

Now, if anyone queries about the person who visited India and Japan in the year 99 and is the
citizen of US, then the output will show two entries having the name of John Smith. This is
simple query generating simple output.
But what if we want to know whether the person in the above query is young or not.
According to the above result, the age of the person is 35 years. But can we assume the
person to be young or not? Similarly, same thing can be applied on the other fields like days
spent, year of visit, etc.

The solution of the above issues can be found with the help of Fuzzy Value sets as follows −

 FV(Age){ very young, young, somewhat old, old }

 FV(Days Spent){ barely few days, few days, quite a few days, many days }
 FV(Year of Visit){distant past, recent past, recent }
 Now if any query will have the fuzzy value then the result will also be fuzzy in nature.
Fuzzy Query System

A fuzzy query system is an interface to users to get information from the database using
(quasi) natural language sentences. Many fuzzy query implementations have been proposed,
resulting in slightly different languages. Although there are some variations according to the
particularities of different implementations, the answer to a fuzzy query sentence is generally
a list of records, ranked by the degree of matching.

Fuzzy Logic - Quantification

In modeling natural language statements, quantified statements play an important role. It

means that NL heavily depends on quantifying construction which often includes fuzzy
concepts like “almost all”, “many”, etc. Following are a few examples of quantifying
propositions −

 Every student passed the exam.

 Every sport car is expensive.
 Many students passed the exam.
 Many sports cars are expensive.

In the above examples, the quantifiers “Every” and “Many” are applied to the crisp
restrictions “students” as well as crisp scope “(person who)passed the exam” and “cars” as
well as crisp scope ”sports”.

Fuzzy Events, Fuzzy Means and Fuzzy Variances

With the help of an example, we can understand the above concepts. Let us assume that we
are a shareholder of a company named ABC. And at present the company is selling each of
its share for ₹40. There are three different companies whose business is similar to ABC but
these are offering their shares at different rates - ₹100 a share, ₹85 a share and ₹60 a share
respectively.

Now the probability distribution of this price takeover is as follows −

 Price ₹100 ₹85 ₹60

Probability 0.3 0.5 0.2

Now, from the standard probability theory, the above distribution gives a mean of expected
price as below −

100×0.3+85×0.5+60×0.2=84.5100×0.3+85×0.5+60×0.2=84.5

And, from the standard probability theory, the above distribution gives a variance of expected
price as below −

(100−84.5)2×0.3+(85−84.5)2×0.5+(60−84.5)2×0.2=124.825(100−84.5)2×0.3+(85−84.5)2×0.
5+(60−84.5)2×0.2=124.825

Suppose the degree of membership of 100 in this set is 0.7, that of 85 is 1, and the degree of
membership is 0.5 for the value 60. These can be reflected in the following fuzzy set −

{0.7100,185,0.560,}{0.7100,185,0.560,}

The fuzzy set obtained in this manner is called a fuzzy event.

We want the probability of the fuzzy event for which our calculation gives −

0.7×0.3+1×0.5+0.5×0.2=0.21+0.5+0.1=0.810.7×0.3+1×0.5+0.5×0.2=0.21+0.5+0.1=0.81

Now, we need to calculate the fuzzy mean and the fuzzy variance, the calculation is as
follows −

Fuzzy_mean =(10.81)×(100×0.7×0.3+85×1×0.5+60×0.5×0.2)=(10.81)×(100×0.7×0.3+85×1×
0.5+60×0.5×0.2)
=85.8=85.8
Fuzzy_Variance =7496.91−7361.91=135.27=7496.91−7361.91=135.27

Fuzzy Logic - Decision Making

It is an activity which includes the steps to be taken for choosing a suitable alternative from
those that are needed for realizing a certain goal.
Steps for Decision Making

Let us now discuss the steps involved in the decision making process −

 Determining the Set of Alternatives − In this step, the alternatives from which the
decision has to be taken must be determined.
 Evaluating Alternative − Here, the alternatives must be evaluated so that the decision
can be taken about one of the alternatives.
 Comparison between Alternatives − In this step, a comparison between the evaluated
alternatives is done.
Types of Decision

Making We will now understand the different types of decision making.

Individual Decision Making

In this type of decision making, only a single person is responsible for taking decisions. The
decision making model in this kind can be characterized as −

 Set of possible actions

 Set of goals Gi(i∈Xn);��(�∈��);
 Set of Constraints Cj(j∈Xm)��(�∈��)

The goals and constraints stated above are expressed in terms of fuzzy sets.

Now consider a set A. Then, the goal and constraints for this set are given by −

Gi(a)��(�) = composition[Gi(a)]
[��(�)] = G1i(Gi(a))��1(��(�)) with G1i��1
Cj(a)��(�) = composition[Cj(a)]
[��(�)] = C1j(Cj(a))��1(��(�)) with C1j��1 for a∈A�∈�

The fuzzy decision in the above case is given by −

FD=min[i∈XinnfGi(a),j∈XinmfCj(a)]��=���[�∈�������(�),�∈���
����(�)]

Multi-person Decision Making

Decision making in this case includes several persons so that the expert knowledge from
various persons is utilized to make decisions.

Calculation for this can be given as follows −

Number of persons preferring xi�� to xj�� = N(xi,xj)�(��,��)

Total number of decision makers = n�
Then, SC(xi,xj)=N(xi,xj)n��(��,��)=�(��,��)�
Multi-objective Decision Making

Multi-objective decision making occurs when there are several objectives to be realized.
There are following two issues in this type of decision making −

 To acquire proper information related to the satisfaction of the objectives by various

alternatives.
 To weigh the relative importance of each objective.

Mathematically we can define a universe of n alternatives as −

A=[a1,a2,...,ai,...,an]�=[�1,�2,...,��,...,��]
And the set of “m” objectives as O=[o1,o2,...,oi,...,on]�=[�1,�2,...,��,...,��]

Multi-attribute Decision Making

Multi-attribute decision making takes place when the evaluation of alternatives can be carried
out based on several attributes of the object. The attributes can be numerical data, linguistic
data and qualitative data.

Mathematically, the multi-attribute evaluation is carried out on the basis of linear equation as
follows −

Y=A1X1+A2X2+...+AiXi+...+ArXr�=�1�1+�2�2+...+����+...+����

Fuzzy Logic - Control System

Fuzzy logic is applied with great success in various control application. Almost all the
consumer products have fuzzy control. Some of the examples include controlling your room
temperature with the help of air-conditioner, anti-braking system used in vehicles, control on
traffic lights, washing machines, large economic systems, etc.

Why Use Fuzzy Logic in Control Systems

A control system is an arrangement of physical components designed to alter another

physical system so that this system exhibits certain desired characteristics. Following are
some reasons of using Fuzzy Logic in Control Systems −

 While applying traditional control, one needs to know about the model and the
objective function formulated in precise terms. This makes it very difficult to apply in
many cases.
 By applying fuzzy logic for control we can utilize the human expertise and experience
for designing a controller.
 The fuzzy control rules, basically the IF-THEN rules, can be best utilized in designing
a controller.
Assumptions in Fuzzy Logic Control (FLC) Design

While designing fuzzy control system, the following six basic assumptions should be made −
  The plant is observable and controllable − It must be assumed that the input, output as
well as state variables are available for observation and controlling purpose.
 Existence of a knowledge body − It must be assumed that there exist a knowledge
body having linguistic rules and a set of input-output data set from which rules can be
extracted.
 Existence of solution − It must be assumed that there exists a solution.
 ‘Good enough’ solution is enough − The control engineering must look for ‘good
enough’ solution rather than an optimum one.
 Range of precision − Fuzzy logic controller must be designed within an acceptable
range of precision.
 Issues regarding stability and optimality − The issues of stability and optimality must
be open in designing Fuzzy logic controller rather than addressed explicitly.
Architecture of Fuzzy Logic Control

The following diagram shows the architecture of Fuzzy Logic Control (FLC).

Major Components of FLC

Followings are the major components of the FLC as shown in the above figure −

 Fuzzifier − The role of fuzzifier is to convert the crisp input values into fuzzy values.
 Fuzzy Knowledge Base − It stores the knowledge about all the input-output fuzzy
relationships. It also has the membership function which defines the input variables to
the fuzzy rule base and the output variables to the plant under control.
 Fuzzy Rule Base − It stores the knowledge about the operation of the process of
domain.
 Inference Engine − It acts as a kernel of any FLC. Basically it simulates human
decisions by performing approximate reasoning.
 Defuzzifier − The role of defuzzifier is to convert the fuzzy values into crisp values
getting from fuzzy inference engine.
Steps in Designing FLC

Following are the steps involved in designing FLC −

 Identification of variables − Here, the input, output and state variables must be
identified of the plant which is under consideration.
 Fuzzy subset configuration − The universe of information is divided into number of
fuzzy subsets and each subset is assigned a linguistic label. Always make sure that
these fuzzy subsets include all the elements of universe.
 Obtaining membership function − Now obtain the membership function for each
fuzzy subset that we get in the above step.
 Fuzzy rule base configuration − Now formulate the fuzzy rule base by assigning
relationship between fuzzy input and output.
 Fuzzification − The fuzzification process is initiated in this step.
 Combining fuzzy outputs − By applying fuzzy approximate reasoning, locate the
fuzzy output and merge them.
 Defuzzification − Finally, initiate defuzzification process to form a crisp output.
Advantages of Fuzzy Logic Control

Let us now discuss the advantages of Fuzzy Logic Control.

 Cheaper − Developing a FLC is comparatively cheaper than developing model based

or other controller in terms of performance.
 Robust − FLCs are more robust than PID controllers because of their capability to
cover a huge range of operating conditions.
 Customizable − FLCs are customizable.
 Emulate human deductive thinking − Basically FLC is designed to emulate human
deductive thinking, the process people use to infer conclusion from what they know.
 Reliability − FLC is more reliable than conventional control system.
 Efficiency − Fuzzy logic provides more efficiency when applied in control system.
Disadvantages of Fuzzy Logic Control

We will now discuss what are the disadvantages of Fuzzy Logic Control.

 Requires lots of data − FLC needs lots of data to be applied.

 Useful in case of moderate historical data − FLC is not useful for programs much
smaller or larger than historical data.
 Needs high human expertise − This is one drawback as the accuracy of the system
depends on the knowledge and expertise of human beings.
 Needs regular updating of rules − The rules must be updated with time.

Adaptive Fuzzy Controller

In this chapter, we will discuss what is an Adaptive Fuzzy Controller and how it works.
Adaptive Fuzzy Controller is designed with some adjustable parameters along with an
embedded mechanism for adjusting them. Adaptive controller has been used for improving
the performance of controller.
Basic Steps for Implementing Adaptive Algorithm

Let us now discuss the basic steps for implementing adaptive algorithm.

 Collection of observable data − The observable data is collected to calculate the

performance of controller.
 Adjustment of controller parameters − Now with the help of controller performance,
calculation of adjustment of controller parameters would be done.
 Improvement in performance of controller − In this step, the controller parameters are
adjusted to improve the performance of controller.
Operational Concepts

Design of a controller is based on an assumed mathematical model that resembles a real

system. The error between actual system and its mathematical representation is calculated
and if it is relatively insignificant than the model is assumed to work effectively.

A threshold constant that sets a boundary for the effectiveness of a controller, also exists. The
control input is fed into both the real system and mathematical model. Here,
assume x(t)�(�) is the output of the real system and y(t)�(�) is the output of the
mathematical model. Then the error ϵ(t)�(�) can be calculated as follows −
ϵ(t)=x(t)−y(t)�(�)=�(�)−�(�)

Here, x� desired is the output we want from the system and μ(t)�(�) is the output coming
from controller and going to both real as well as mathematical model.

The following diagram shows how the error function is tracked between output of a real
system and Mathematical model −
Parameterization of System

A fuzzy controller the design of which is based on the fuzzy mathematical model will have
the following form of fuzzy rules −

Rule 1 −
IF x1(tn)∈X11AND...ANDxi(tn)∈X1i�1(��)∈�11���...�����(��)∈�1�
THEN μ1(tn)=K11x1(tn)+K12x2(tn)+...+K1ixi(tn)�1(��)=�11�1(��)
+�12�2(��)+...+�1���(��)
Rule 2 −
IF x1(tn)∈X21AND...ANDxi(tn)∈X2i�1(��)∈�21���...�����(��)∈�2�
THEN μ2(tn)=K21x1(tn)+K22x2(tn)+...+K2ixi(tn)�2(��)=�21�1(��)
+�22�2(��)+...+�2���(��)

Rule j −
IF x1(tn)∈Xk1AND...ANDxi(tn)∈Xki�1(��)∈��1���...�����(��)∈��
�
THEN μj(tn)=Kj1x1(tn)+Kj2x2(tn)+...+Kjixi(tn)��(��)=��1�1(��)
+��2�2(��)+...+�����(��)

The above set of parameters characterizes the controller.

Mechanism Adjustment

The controller parameters are adjusted to improve the performance of controller. The process
of calculating the adjustment to the parameters is the adjusting mechanism.

Mathematically, let θ(n)�(�) be a set of parameters to be adjusted at time t=tn�=��.

The adjustment can be the recalculation of the parameters,
θ(n)=Θ(D0,D1,...,Dn)�(�)=Θ(�0,�1,...,��)

Here Dn�� is the data collected at time t=tn�=��.

Now this formulation is reformulated by the update of the parameter set based on its previous
value as,

θ(n)=ϕ(θn−1,Dn)�(�)=�(��−1,��)

Parameters for selecting an Adaptive Fuzzy Controller

The following parameters need to be considered for selecting an adaptive fuzzy controller −

 Can the system be approximated entirely by a fuzzy model?

  If a system can be approximated entirely by a fuzzy model, are the parameters of this
fuzzy model readily available or must they be determined online?
 If a system cannot be approximated entirely by a fuzzy model, can it be approximated
piecewise by a set of fuzzy model?
 If a system can be approximated by a set of fuzzy models, are these models having the
same format with different parameters or are they having different formats?
 If a system can be approximated by a set of fuzzy models having the same format,
each with a different set of parameters, are these parameter sets readily available or
must they be determined online?

Fuzziness in Neural Networks

Artificial neural network (ANN) is a network of efficient computing systems the central
theme of which is borrowed from the analogy of biological neural networks. ANNs are also
named as “artificial neural systems,” parallel distributed processing systems,” “connectionist
systems.” ANN acquires large collection of units that are interconnected in some pattern to
allow communications between units. These units, also referred to as nodes or neurons, are
simple processors which operate in parallel.

Every neuron is connected with other neuron through a connection link. Each connection link
is associated with a weight having the information about the input signal. This is the most
useful information for neurons to solve a particular problem because the weight usually
inhibits the signal that is being communicated. Each neuron is having its internal state which
is called the activation signal. Output signals, which are produced after combining the input
signals and the activation rule, may be sent to other units. It also consists of a bias ‘b’ whose
weight is always 1.