Scribd
Upload
5 views4 pages

Fuzzy_Logic_Elaborated_Notes

The document provides an overview of fuzzy logic, focusing on fuzzy implications, membership functions, rules, and the architecture of fuzzy logic systems. It explains how fuzzy logic allows for reasoning with degrees of truth, contrasting it with classical binary logic, and outlines processes such as fuzzification and defuzzification. Additionally, it details operations on fuzzy sets, emphasizing their application in control systems and decision-making.

Uploaded by

Sanidhya Gupta
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
5 views4 pages

Fuzzy_Logic_Elaborated_Notes

The document provides an overview of fuzzy logic, focusing on fuzzy implications, membership functions, rules, and the architecture of fuzzy logic systems. It explains how fuzzy logic allows for reasoning with degrees of truth, contrasting it with classical binary logic, and outlines processes such as fuzzification and defuzzification. Additionally, it details operations on fuzzy sets, emphasizing their application in control systems and decision-making.

Uploaded by

Sanidhya Gupta
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

Soft Computing – Elaborated Fuzzy

Logic Notes
Fuzzy Implications (with Example)

Fuzzy implication is a fundamental concept in fuzzy logic systems, expressing the


relationship between fuzzy propositions. It handles the reasoning of the form: "IF A THEN
B", where A and B are fuzzy sets.

In classical logic, this is binary — either true or false. But in fuzzy logic, we consider the
degrees of truth.

There are several implication operators in fuzzy logic. The most commonly used ones
include:

1. Mamdani Implication: µA→B(x, y) = min(µA(x), µB(y))


2. Larsen Product: µA→B(x, y) = µA(x) * µB(y)

**Example:** IF temperature is high THEN fan speed is fast.


- Here, "high" and "fast" are fuzzy sets.
- The degree of truth of this implication depends on the degree of membership of the actual
temperature and fan speed in their respective sets.

Principle of Fuzzy Logic

Fuzzy logic is based on the idea of partial truth, where the truth value may range between
completely true and completely false. It is inspired by the way humans make decisions —
not in black-and-white terms but in shades of gray.

**Key Principles:**
- Fuzzy logic deals with reasoning that is approximate rather than fixed and exact.
- It operates using **linguistic variables** (like "low", "medium", "high") rather than precise
numerical values.
- It is built upon fuzzy set theory, where elements have degrees of membership.

Fuzzy logic is especially useful in control systems, decision-making, and pattern recognition
where information is incomplete or imprecise.
Fuzzy Membership Function and Types

A fuzzy membership function represents how each point in the input space is mapped to a
membership value (degree of truth) between 0 and 1.

**Common Types of Membership Functions:**


1. **Triangular:** Simple and commonly used.
2. **Trapezoidal:** Flat top — suitable when there’s a range with equal degree.
3. **Gaussian:** Smooth curve — used when uncertainty is normally distributed.
4. **Bell-shaped:** Generalization of Gaussian.
5. **Singleton:** Used in control systems with a specific crisp value.

**Example:** For fuzzy set "Young":


- µ(20) = 1.0 (definitely young)
- µ(35) = 0.4 (somewhat young)

Fuzzy Rules (with Example)

Fuzzy rules are conditional statements in the form of IF-THEN that relate input variables to
output variables using fuzzy logic.

**Example Rule Set:**


- IF temperature is high THEN fan speed is fast.
- IF temperature is medium THEN fan speed is medium.
- IF temperature is low THEN fan speed is slow.

These rules are evaluated by the inference engine to generate fuzzy outputs based on input
conditions. The outputs are then defuzzified to get crisp results.

Fuzzy Set vs Crisp Set

**Crisp Set:**
- Elements either belong or do not belong (membership is 0 or 1).
- Example: A person aged 18 is an adult (yes or no).

**Fuzzy Set:**
- Elements can partially belong (membership between 0 and 1).
- Example: A person aged 18 may be 0.7 "young" and 0.3 "adult".
Fuzzy sets allow more realistic modeling of concepts that are vague or gradual in nature.

Fuzzy to Crisp Conversion (Defuzzification)

After fuzzy reasoning is completed, the fuzzy output needs to be converted into a crisp
value. This process is called defuzzification.

**Common Defuzzification Methods:**


1. **Centroid Method (Center of Gravity):** Most widely used; computes the center of area
under the curve.
2. **Bisector Method:** Divides the area into two equal halves.
3. **Maximum Membership Principle:** Chooses the value with the highest membership
degree.
4. **Weighted Average Method:** Weighted mean of output values.

Defuzzification is essential for practical implementation of fuzzy systems where crisp


actions are needed.

Architecture of Fuzzy Logic System

**Basic Components:**
1. **Fuzzification Module:** Converts crisp input into fuzzy values using membership
functions.
2. **Knowledge Base:** Stores the set of fuzzy rules (rule base) and the membership
functions (database).
3. **Inference Engine:** Evaluates the fuzzy rules and determines the fuzzy output.
4. **Defuzzification Module:** Converts fuzzy output to crisp output.

This architecture allows fuzzy logic systems to process vague inputs and make intelligent
decisions.

Fuzzification and Defuzzification

**Fuzzification:** The process of converting real-world crisp input values into fuzzy values
using predefined membership functions.

**Defuzzification:** The reverse process — converting fuzzy results from inference into a
crisp output that can be acted upon.
These processes are key to interfacing fuzzy systems with the real world.

Operations on Fuzzy Sets

Fuzzy sets can be combined or manipulated using fuzzy operations, similar to classical set
theory but adapted to partial membership.

**Basic Operations:**
1. **Union (A ∪ B):** µA∪B(x) = max(µA(x), µB(x))
2. **Intersection (A ∩ B):** µA∩B(x) = min(µA(x), µB(x))
3. **Complement (~A):** µ~A(x) = 1 - µA(x)

These operations help model complex fuzzy systems by combining fuzzy conditions.

You might also like