CS 621 Artificial Intelligence Lecture 7 - 16/08/05 Prof.

Pushpak Bhattacharyya

Fuzzy Set (contd) Fuzzy Logic (Start)

16-08-05 Prof. Pushpak Bhattacharyya, IIT Bombay 1

Fuzzy Subset
U = {1, 2, 3, 4,.,10} A = {1, 2, 3, 4, 5} B = {2, 3, 4} B A in CRISP SET THEORY A(x) >= B(x), x In terms of membership predicate Crisp subsethood S1(x) <= S2(x), x
16-08-05 Prof. Pushpak Bhattacharyya, IIT Bombay 2

Geometric Interpretation
U = {x1 , x2}
(0,1) x2 B1 B2 (0,0) B3

(1,1) A

(1,0)

x1

Bis are such that Bi(x) <= A(x), x

16-08-05 Prof. Pushpak Bhattacharyya, IIT Bombay 3

Geometric Interpretation (Contd 1)

The points within the hypercube for which A is the upper right corner are the subsets of A. Space defined by the square is the power set of A. Formulation of ZADEH, classical fuzzy set theory For B to be a subset of A, B(x) <= A(x), x. This means B P(A) crisply. A
B 16-08-05 Prof. Pushpak Bhattacharyya, IIT Bombay 4

Geometric Interpretation (Contd 2)

Each Bi is a subset of A to some degree.
B3 B2 A B1

Result of Union, Intersection, Complement is a SET Subsethood is a question

16-08-05 Prof. Pushpak Bhattacharyya, IIT Bombay 5

Fuzzy Definition of Subsethood

S(B,A) = subsethood of B wrt A = 1 x max(0, B(x) A(x)) x B(x) Question Can S(B,A) be 0.

16-08-05

Prof. Pushpak Bhattacharyya, IIT Bombay

Theorem
S(B,A) = m(A B) m(B) m(S) = cardinality of S = xS(x)

16-08-05

Prof. Pushpak Bhattacharyya, IIT Bombay

Proof of the Theorem

Proof: RHS = 1 xmax(0, B(x) A(x)) xB(x)

= x B(x) xmax(0, B(x) A(x)) m(B)

16-08-05

Prof. Pushpak Bhattacharyya, IIT Bombay

Proof of the Theorem (Contd)

= xmin(A(x), B(x)) m(B) = m(A B) m(B) = LHS

16-08-05

Prof. Pushpak Bhattacharyya, IIT Bombay

Entropy of Subsethood
E(A) = m(A Ac) m(A Ac) S(B,A) = m(A B) m(B) S(A Ac, A Ac)

= m((A Ac) (A Ac)) m(A Ac) = m(A Ac) = E(A) m(A Ac)
10

16-08-05

Prof. Pushpak Bhattacharyya, IIT Bombay

Entropy of Fuzzy Set

Entropy of fuzzy set is the degree by which A Ac is a subset of A Ac Entropy is a measure by which WHOLE IS A SUBSET of its OWN PART !!! Subsethood in non-classical fuzzy logic is a degree statement. This influences the notion of Implication.

16-08-05

Prof. Pushpak Bhattacharyya, IIT Bombay

11

Fuzzy Logic
Set Theory Set S S1 S2 S1 S2 S1 S2 Logic S(x) S1(x) S2(x) S1(x) S2(x) S1(x) S2(x)

16-08-05

Prof. Pushpak Bhattacharyya, IIT Bombay

12

Definitions of Logic Operations

Let P1 and P2 be fuzzy logic variables /predicates. 0 <= t(P1) <= 1 0 <= t(P2) <= 1 Fuzzy Logic

16-08-05

Prof. Pushpak Bhattacharyya, IIT Bombay

13

Fuzzy Operations
Fuzzy : max (t(P1), t(P2)) Fuzzy : min(t(P1), t(P2)) Fuzzy ~ : 1 t(P)

16-08-05

Prof. Pushpak Bhattacharyya, IIT Bombay

14

Implication
LUKISEWITZ LOGIC Many multi-valued logic in 1930

t(P1) t(P2) = min (1, 1-t(P1) + t(P2))

16-08-05

Prof. Pushpak Bhattacharyya, IIT Bombay

15

Inferencing
Modus Ponens Given P1 & P1 P2 conclude P2 t(P1) = 1, t(P1 P2) = 1 conclude t(P2) = 1 - classical logic

16-08-05

Prof. Pushpak Bhattacharyya, IIT Bombay

16

Modus Tolens
Given ~P2 and P1 P2 conclude ~P1 i.e t(P2) = 0, t(P1 P2) = 1 Conclude t(P2) = 0 - classical logic
16-08-05 Prof. Pushpak Bhattacharyya, IIT Bombay 17

In Fuzzy Logic
We are given t(P1) = a, 0<= a <= 1 t(P1 P2) = b, 0<= b <=1 What can we say for t(P2) t(P1 P2) =min(1, 1 t(P1) + t(P2)) By definition Luk. system of logic From given values t(P1 P2) = min(1, 1 a + t(P2)) t(P1 P2) = b
16-08-05 Prof. Pushpak Bhattacharyya, IIT Bombay 18

Case 1
b = min(1, 1 a + t(P2)) b=1 1 a + t(P2) >= 1 or t(P2) >= a - case of complete truth transfer

16-08-05

Prof. Pushpak Bhattacharyya, IIT Bombay

19

Case 2
b<1 1 a + t(P2) = b or t(P2) = a + b 1 Combining 1 and 2 t(P2) = a + b -1 But this allows t(P2) to be < 0 t(P2) = max(0, a + b -1) Fuzzy modus ponens.
16-08-05 Prof. Pushpak Bhattacharyya, IIT Bombay 20

Fuzzy Modus Tolens

t(P1 P2) = b t(P2) <= a, 0<=a<=1 What is t(P1) Exercise: Deduce expression for fuzzy modus tolens

16-08-05

Prof. Pushpak Bhattacharyya, IIT Bombay

21