Unit 3 - Application of Soft Computing (RCS-071)

The term fuzzy refers to things which are not clear or are vague. In the real world many times we
encounter a situation when we can’t determine whether the state is true or false, their fuzzy logic
provides a very valuable flexibility for reasoning. In this way, we can consider the inaccuracies
and uncertainties of any situation.
Fuzzy Logic was introduced in 1965 by Lofti A. Zadeh in his research paper “Fuzzy Sets”. He is
considered as the father of Fuzzy Logic.

In Boolean system truth value, 1.0 represents absolute truth value and 0.0 represents absolute
false value. But in the fuzzy system, there is no logic for absolute truth and absolute false value.
But in fuzzy logic, there is intermediate value too present which is partially true and partially
false.

In other words, we can say that fuzzy logic is not logic that is fuzzy, but logic that is used to describe
fuzziness.

ARCHITECTURE
Its Architecture contains four parts :
 RULE BASE: It contains the aet of rules and the IF-THEN conditions provided by the
experts to govern the decision making system, on the basis of linguistic information.
Recent developments in fuzzy theory offer several effective methods for the design and
tuning of fuzzy controllers. Most of these developments reduce the number of fuzzy rules.

 FUZZIFICATION: It is used to convert inputs i.e. crisp numbers into fuzzy sets. Crisp
inputs are basically the exact inputs measured by sensors and passed into the control
system for processing, such as temperature, pressure, rpm’s, etc.

 INFERENCE ENGINE: It determines the matching degree of the current fuzzy input with
respect to each rule and decides which rules are to be fired according to the input field.
Next, the fired rules are combined to form the control actions.
  DEFUZZIFICATION: It is used to convert the fuzzy sets obtained by inference engine into
a crisp value. There are several defuzzification methods available and the best suited one is
used with a specific expert system to reduce the error.

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 as the universe of discourse or universal set
(u), which contain all the possible elements of concern in each particular application.
Example:
The set of tall men – But… what is tall? – Height is all relative – As a descriptive term, tall is
very subjective and relies on the context in which it is used .
Even a 5ft7 man can be considered "tall" when he is surrounded by people shorter than he is.
It is impossible to give a classic definition for the subset of tall men. However, we could
establish to which degree a man can be considered tall .This can be done using membership
functions.
There are largely three types of fuzzifiers:
 Singleton fuzzifier,
 Gaussian fuzzifier, and
 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 lead 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 mathematical description of our approach.
  As fuzzy logic works on precise as well as imprecise data so most of the time accuracy is
compromised.
A set is an unordered collection of different elements. It can be written explicitly by listing its
elements using the set bracket. If the order of the elements is changed or any element of a set is
repeated, it does not make any changes in the set.

Example

 A set of all positive integers.

 A set of all the planets in the solar system.
 A set of all the states in India.
 A set of all the lowercase letters of the alphabet.

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.
 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.

1. Fuzzy set is a set having degrees of membership between 1 and 0. Fuzzy sets are
represented with tilde character(~). For example, Number of cars following traffic signals
at a particular time out of all cars present will have membership value between [0,1].
2. Partial membership exists when member of one fuzzy set can also be a part of other fuzzy
sets in the same universe.
3. The degree of membership or truth is not same as probability, fuzzy truth represents
membership in vaguely defined sets.
4. A fuzzy set A~ in the universe of discourse, U, can be defined as a set of ordered pairs
and it is given by

5. When the universe of discourse, U, is discrete and finite, fuzzy set A~ is given by

where “n” is a finite value.

6. Fuzzy sets also satisfy every property of classical sets.

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.
 Common Operations on fuzzy sets: Given two Fuzzy sets A~ and B~
 Union : Fuzzy set C~ is union of Fuzzy sets A~ and B~ :

 Intersection: Fuzzy set D~ is intersection of Fuzzy sets A~ and B~ :

 Complement: Fuzzy set E~ is complement of Fuzzy set A~ :

2. Some other useful operations on Fuzzy set:

 Algebraic sum:

 Algebraic product:

 Bounded sum:

 Bounded difference:

 Cartesian Product :

Let A1, A2, ….., An be fuzzy sets in U1, U2, …Un, respectively. The Cartesian
product of A1, A2, ….., An is a fuzzy set in the space U1 x U2 x…x Un with the
membership function as:

µA1 x A2 x…x An (x1, x2,., xn) = min [µA1 (x1), µA2 (x2), .. µAn (xn)]

So, the Cartesian product of A1, A2, ….., An are donated by A1 x A2 x….. x An
 Properties of Fuzzy Sets:

Given A and B are two fuzzy sets, here are the main properties of those fuzzy sets:

Commutativity :-
 (A ∪ B) = (B ∪ A)
 (A ∩ B) = (B ∩ A)

Associativity :-
 (A ∪ B) ∪ C = A ∪ (B ∪ C)
 (A ∩ B) ∩ C = A ∩ (B ∩ C)

Distributivity :-
 A ∪ (B ∩ C) = (A ∪ B) ∩ (A ∪ C)
 A ∩ (B ∪ C) = (A ∩ B) ∪ (A ∩ C)

Idempotent :-
 A∪A=A
 A∩A=A

Identity :-
 A ∪ Φ = A => A ∪ X = X
 A ∩ Φ = Φ => A ∩ X = A
Note: (1) Universal Set ‘X’ has elements with unity membership value.
(2) Null Set ‘Φ’ has all elements with zero membership value.

Transitivity :-
 If A ⊆ B, B ⊆ C, then A ⊆ C

Involution :-
 (Ac)c = A

De morgan Property :-
 (A ∪ B) = A ∩ B
c c c

 (A ∩ B) = A ∪ B
c c c

Note: A ∪ A ≠ X ; A ∩ Ac ≠ Φ
c

Since fuzzy sets can overlap “law of excluded middle” and “law of contradiction” does not
hold good.

Definition of Crisp or Classical 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.

Operations on Classical or Crisp Sets:

Set Operations include Set Union, Set Intersection, Set Difference, Complement of Set, and
Cartesian Product.

Union:
The union of sets A and B (denoted by A ∪ B) is the set of elements which are in A, in B,
or in both A and B. Hence, A ∪ B = {x|x ∈ A OR x ∈ B}.
Example − If A = {10,11,12,13} and B = {13,14,15}, then A ∪ B = {10,11,12,13,14,15} –
The common element occurs only once.

Intersection:
The intersection of sets A and B (denoted by A ∩ B) is the set of elements which are in
both A and B. Hence, A ∩ B = {x|x ∈ A AND x ∈ B}.
Difference/ Relative Complement:
The set difference of sets A and B (denoted by A–B) is the set of elements which are only
in A but not in B. Hence, A − B = {x|x ∈ A AND x ∉ B}.
Example − If A = {10,11,12,13} and B = {13,14,15}, then (A − B) = {10,11,12} and (B −
A) = {14,15}. Here, we can see (A − B) ≠ (B − A)

Complement of a Set:
The complement of a set A (denoted by A′) is the set of elements which are not in set A.
Hence, A′ = {x|x ∉ A}.
More specifically, A′ = (U−A) where U is a universal set which contains all objects.
Example − If A = {x|x belongs to set of add integers} then A′ = {y|y does not belong to set
of odd integers}

Cartesian Product / Cross Product:

The Cartesian product of n number of sets A1,A2,…An denoted as A1 × A2...× An can be
defined as all possible ordered pairs (x1,x2,…xn) where x1 ∈ A1,x2 ∈ A2,…xn ∈ An
Example − If we take two sets A = {a,b} and B = {1,2},
The Cartesian product of A and B is written as − A × B = {(a,1),(a,2),(b,1),(b,2)}
And, the Cartesian product of B and A is written as − B × A = {(1,a),(1,b),(2,a),(2,b)}

Properties of Crisp or Classical Sets:

Properties on sets play an important role for obtaining the solution. Following are the
different properties of classical sets –

Commutative Property:
Having two sets A and B, this property states −
A∪B=B∪A
A∩B=B∩A

Associative Property:
Having three sets A, B and C, this property states −
A∪(B∪C)=(A∪B)∪C
A∩(B∩C)=(A∩B)∩C

Distributive Property:
Having three sets A, B and C, this property states −
A∪(B∩C)=(A∪B)∩(A∪C)
A∩(B∪C)=(A∩B)∪(A∩C)

Idempotency Property:
For any set A, this property states −
A∪A=A
A∩A=A

Identity Property:
For set A and universal set X, this property states −
A∪φ=A
A∩X=A
A∩φ=φ
A∪X=X

Transitive Property:
Having three sets A, B and C, the property states −
If A⊆B⊆C, then A⊆C

Involution Property:
For any set A, this property states −
A¯ ¯=A

De Morgan’s Law:
It is a very important law and supports in proving tautologies and contradiction. This law
states −
A∩B¯¯=A¯∪B¯
A∪B¯¯=A¯∩B¯