What Is Fuzzy Logic
What Is Fuzzy Logic
What Is Fuzzy Logic
The 'Fuzzy' word means the things that are not clear or are vague. Sometimes, we
cannot decide in real life that the given problem or statement is either true or false.
At that time, this concept provides many values between the true and false and gives
the flexibility to find the best solution to that problem.
Fuzzy logic contains the multiple logical values and these values are the truth values
of a variable or problem between 0 and 1. This concept was introduced by Lofti
Zadeh in 1965 based on the Fuzzy Set Theory. This concept provides the
possibilities which are not given by computers, but similar to the range of
possibilities generated by humans.
In the Boolean system, only two possibilities (0 and 1) exist, where 1 denotes the
absolute truth value and 0 denotes the absolute false value. But in the fuzzy system,
there are multiple possibilities present between the 0 and 1, which are partially false
and partially true.
1. This concept is flexible and we can easily understand and implement it.
2. It is used for helping the minimization of the logics created by the human.
3. It is the best method for finding the solution of those problems which are
suitable for approximate or uncertain reasoning.
4. It always offers two values, which denote the two possible solutions for a
problem and statement.
5. It allows users to build or create the functions which are non-linear of arbitrary
complexity.
6. In fuzzy logic, everything is a matter of degree.
7. In the Fuzzy logic, any system which is logical can be easily fuzzified.
8. It is based on natural language processing.
9. It is also used by the quantitative analysts for improving their algorithm's
execution.
10. It also allows users to integrate with the programming.
1. Rule Base
2. Fuzzification
3. Inference Engine
4. Defuzzification
2. Fuzzification
Fuzzification is a module or component for transforming the system inputs, i.e., it
converts the crisp number into fuzzy steps. The crisp numbers are those inputs which
are measured by the sensors and then fuzzification passed them into the control
systems for further processing. This component divides the input signals into
following five states in any Fuzzy Logic system:
3. Inference Engine
This component is a main component in any Fuzzy Logic system (FLS), because all
the information is processed in the Inference Engine. It allows users to find the
matching degree between the current fuzzy input and the rules. After the matching
degree, this system determines which rule is to be added according to the given
input field. When all rules are fired, then they are combined for developing the
control actions.
4. Defuzzification
Defuzzification is a module or component, which takes the fuzzy set inputs
generated by the Inference Engine, and then transforms them into a crisp value. It
is the last step in the process of a fuzzy logic system. The crisp value is a type of
value which is acceptable by the user. Various techniques are present to do this, but
the user has to select the best one for reducing the errors.
Membership Function
The membership function is a function which represents the graph of fuzzy sets,
and allows users to quantify the linguistic term. It is a graph which is used for
mapping each element of x to the value between 0 and 1.
This function of Membership was introduced in the first papers of fuzzy set
by Zadeh. For the Fuzzy set B, the membership function for X is defined as: μB:X →
[0,1]. In this function X, each element of set B is mapped to the value between 0 and
1. This is called a degree of membership or membership value.
Set
A set is a term, which is a collection of unordered or ordered elements. Following are
the various examples of a set:
1. Finite
2. Empty
3. Infinite
4. Proper
5. Universal
6. Subset
7. Singleton
8. Equivalent Set
9. Disjoint Set
Classical Set
It is a type of set which collects the distinct objects in a group. The sets with the crisp
boundaries are classical sets. In any set, each single entity is called an element or
member of that set.
Any set can be easily denoted in the following two different ways:
1. Roaster Form: This is also called as a tabular form. In this form, the set is
represented in the following way:
The elements in the set are enclosed within the brackets and separated by the
commas.
ADVERTISEMENT
ADVERTISEMENT
Following are the two examples which describes the set in Roaster or Tabular form:
Example 1:
Example 2:
Set of Prime Numbers less than 50: X={2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41,
43, 47}.
2. Set Builder Form: Set Builder form defines a set with the common properties of
an element in a set. In this form, the set is represented in the following way:
A = {x:p(x)}
The set {2, 4, 6, 8, 10, 12, 14, 16, 18} is written as:
B = {x:2 ≤ x < 20 and (x%2) = 0}
Following are the various operations which are performed on the classical sets:
1. Union Operation
2. Intersection Operation
3. Difference Operation
4. Complement Operation
1. Union:
This operation is denoted by (A U B). A U B is the set of those elements which exist in
two different sets A and B. This operation combines all the elements from both the
sets and make a new set. It is also called a Logical OR operation.
A ∪ B = { x | x ∈ A OR x ∈ B }.
Example:
Set A = {10, 11, 12, 13}, Set B = {11, 12, 13, 14, 15}, then A ∪ B = {10, 11, 12, 13,
14, 15}
2. Intersection
This operation is denoted by (A ∩ B). A ∩ B is the set of those elements which are
common in both set A and B. It is also called a Logical OR operation.
It can be described as:
A ∩ B = { x | x ∈ A AND x ∈ B }.
Example:
Set A = {10, 11, 12, 13}, Set B = {11, 12, 14} then A ∩ B = {11, 12}
3. Difference Operation
This operation is denoted by (A - B). A-B is the set of only those elements which exist
only in set A but not in set B.
A - B = { x | x ∈ A AND x ∉ B }.
A′ = {x|x ∉ A}.
There are following various properties which play an essential role for finding the
solution of a fuzzy logic problem.
1. Commutative Property:
This property provides the following two states which are obtained by two finite sets
A and B:
A ∪ B = B ∪ A
A∩B=B∩A
2. Associative Property:
This property also provides the following two states but these are obtained by three
different finite sets A, B, and C:
A ∪ (B ∪ C) = (A ∪ B) ∪ C
A ∩ (B ∩ C) = (A ∩ B) ∩ C
3. Idempotency Property:
This property also provides the following two states but for a single finite set A:
A ∪ A = A
A∩A=A
4. Absorption Property
This property also provides the following two states for any two finite sets A and B:
A ∪ (A ∩ B) = A
A ∩ (A ∪ B) = A
5. Distributive Property:
This property also provides the following two states for any three finite sets A, B, and
C:
A∪ (B ∩ C) = (A ∪ B)∩ (A ∪ C)
A∩ (B ∪ C) = (A∩B) ∪ (A∩C)
6. Identity Property:
This property provides the following four states for any finite set A and Universal set
X:
A ∪ φ =A
A ∩ X = A
A ∩ φ = φ
A∪X=X
7. Transitive property
This property provides the following state for the finite sets A, B, and C:
If A ⊆ B ⊆ C, then A ⊆ C
8. Ivolution property
This property provides following state for any finite set A:
9. De Morgan's Law
This law gives the following rules for providing the contradiction and tautologies:
Fuzzy Set
The set theory of classical is the subset of Fuzzy set theory. Fuzzy logic is based on
this theory, which is a generalisation of the classical theory of set (i.e., crisp set)
introduced by Zadeh in 1965.
A fuzzy set is a collection of values which exist between 0 and 1. Fuzzy sets are
denoted or represented by the tilde (~) character. The sets of Fuzzy theory were
introduced in 1965 by Lofti A. Zadeh and Dieter Klaua. In the fuzzy set, the partial
membership also exists. This theory released as an extension of classical set theory.
This theory is denoted mathematically asA fuzzy set (Ã) is a pair of U and M, where U
is the Universe of discourse and M is the membership function which takes on values
in the interval [ 0, 1 ]. The universe of discourse (U) is also denoted by Ω or X.
Example:
then,
For X1
For X2
For X3
For X4
μA∪B(X4) = max (μA(X4), μB(X4))
μA∪B(X4) = max (0.4, 0.9)
μA∪B(X4) = 0.9
Example:
then,
For X1
For X2
For X3
μĀ(x) = 1-μA(x),
Example:
then,
For X1
μĀ (X1) = 1-μA(X1)
μĀ (X1) = 1 - 0.3
μĀ (X1) = 0.7
For X2
μĀ (X2) = 1-μA(X2)
μĀ (X2) = 1 - 0.8
μĀ (X2) = 0.2
For X3
μĀ (X3) = 1-μA(X3)
μĀ (X3) = 1 - 0.5
μĀ (X3) = 0.5
For X4
μĀ (X4) = 1-μA(X4)
μĀ (X4) = 1 - 0.1
μĀ (X4) = 0.9
1. This theory is a class of those sets having sharp 1. This theory is a class of those se
boundaries. boundaries.
2. This set theory is defined by exact boundaries only 0 2. This set theory is defined by ambiguou
and 1.
3. In this theory, there is no uncertainty about the 3. In this theory, there always exists un
boundary's location of a set. boundary's location of a set.
4. This theory is widely used in the design of digital 4. It is mainly used for fuzzy controllers.
systems.
1. The run time of fuzzy logic systems is slow and takes a long time to produce
outputs.
2. Users can understand it easily if they are simple.
3. The possibilities produced by the fuzzy logic system are not always accurate.
4. Many researchers give various ways for solving a given statement using this
technique which leads to ambiguity.
5. Fuzzy logics are not suitable for those problems that require high accuracy.
6. The systems of a Fuzzy logic need a lot of testing for verification and
validation.
Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.
Alternative Proxies: