M odels for Inexact Reasoning Fuzzy Logic Lesson 6 Inference from - - PowerPoint PPT Presentation

m odels for inexact reasoning fuzzy logic lesson 6
SMART_READER_LITE
LIVE PREVIEW

M odels for Inexact Reasoning Fuzzy Logic Lesson 6 Inference from - - PowerPoint PPT Presentation

M odels for Inexact Reasoning Fuzzy Logic Lesson 6 Inference from Conditional Fuzzy Propositions M aster in Computational Logic Department of Artificial Intelligence Inference in Classical Logic Inference rules in classical logic are


slide-1
SLIDE 1

M odels for Inexact Reasoning Fuzzy Logic – Lesson 6 Inference from Conditional Fuzzy Propositions

M aster in Computational Logic Department of Artificial Intelligence

slide-2
SLIDE 2

Inference in Classical Logic

  • Inference rules in classical logic are based on tautologies
  • Three classical inference rules:

– M odus Ponendo Ponens (M odus Ponens)

  • Latin for “ The way that affirms by affirming”

– M odus Tollens (M odus Tollendo Tollens)

  • Latin for “ The way that denies by denying”

– Hypothetical Syllogism

p q p q → p q q p → ¬ ¬ p q q r p r → → →

slide-3
SLIDE 3

Generalization of Inference Rules

  • Classical inference rules can be generalized in

the context of fuzzy logic

  • Generalized inference rules provide a

framework to facilitate approximate reasoning

  • Generalized versions of M P

, M T and HS

  • Generalization based on:

– Fuzzy relations – The compositional rule of inference

slide-4
SLIDE 4

The Compositional Rule of Inference

  • Let R be a crisp relation defined over X×Y
  • Given a value x=u it is possible to infer that

y∈B = {y∈Y| <u, y>∈R}

  • M oreover, given a set A⊆X we can infer that

y∈B = {y∈Y| <x, y>∈R, x∈A}

slide-5
SLIDE 5

The Compositional Rule of Inference

  • Now assume that R is a fuzzy relation on X×Y
  • Let A’ be a fuzzy set defined over the elements of

the crisp set X

  • It is possible to infer a fuzzy set B’ defined over

the elements of the crisp set Y

( )

' '

( ) sup min ( ), ( , )

B A x X

y x R x y µ µ

=    

slide-6
SLIDE 6

The Compositional Rule of Inference

  • When dealing with discrete sets the CRI can

be also expressed in matrix form

  • Resorting to the definition of the composition
  • f fuzzy relations we have:

( ) ( ) ( )

' ' B A R =

  • A’ is the vector associated to fuzzy set A’
  • R is the matrix associated to fuzzy relation R
  • B’ is the vector associated to the inferred fuzzy

set B’

slide-7
SLIDE 7

The Generalized M odus Ponens

  • Let consider the following conditional fuzzy

proposition: p: “ If X is A, then Y is B”

  • Note that a fuzzy relation R is embedded in p

– An implication relationship between fuzzy sets A, B

( , ) ( ( ), ( ))

A B

R x y J x y µ µ =

  • The operator J(⋅,⋅) denotes a fuzzy implication
slide-8
SLIDE 8

The Generalized M odus Ponens

  • Now, we are given a second proposition

q: “ X is A’”

  • Viewing p as a rule and q as a fact we have:
  • Applying the CRI on R’ and A’ we can conclude

that:

Rule: If X is A, then Y is B Fact: X is A’ ======================== Conclusion: Y is B’

slide-9
SLIDE 9

Example

  • X = {x1, x2, x3}, Y = {y1, y2}
  • A = .5/ x1 + 1/ x2 + .6/ x3, B = 1/ y1 + .4/ y2
  • A’ = .6/ x1 + .9/ x2 + .7/ x3
  • Use the compositional rule of inference to

derive a conclusion in the form “ Y is B’”

  • Use Lukasiewicz’s implication

– J(x, y) = min(1, 1-a+b)

slide-10
SLIDE 10

The Generalized M odus Tollens

  • The generalized modus tollens is expressed as:

Rule: If X is A, then Y is B Fact: Y is B’ ============================== Conclusion: X is A’

  • In this case, the CRI is expressed as follows:

( )

' '

( ) sup min ( ), ( , )

A B y Y

x y R x y µ µ

=    

  • Or in matrix form:

' ' A B R =

slide-11
SLIDE 11

Example

  • X = {x1, x2, x3}, Y = {y1, y2}
  • A = .5/ x1 + 1/ x2 + .6/ x3, B = 1/ y1 + .4/ y2
  • B’ = .9/ y1 + .7/ y2
  • Use the compositional rule of inference to

derive a conclusion in the form “ X is A’”

  • Use Lukasiewicz’s implication

– J(x, y) = min(1, 1-a+b)

slide-12
SLIDE 12

The Generalized Hypothetical Syllogism

  • The HS can be expressed as follows:

Rule 1: If X is A, then Y is B Rule 2: If Y is B, then Z is C ============================== Conclusion: If X is A, then Z is C

  • In this case, we can say that the HS holds if:

( )

3 1 2

( , ) sup min ( , ), ( , )

y Y

R x z R x y R y z

=    

  • Or in matrix form:

3 1 2

R R R =

slide-13
SLIDE 13

Example

  • X = {x1, x2, x3}, Y = {y1, y2}, Z = {z1, z2}
  • A = .5/ x1 + 1/ x2 + .6/ x3, B = 1/ y1 + .4/ y2, C = .2/ z1 +

1/ z2

  • Determine whether or not the HS holds in this

case

  • Use the following implication:

1 ( , ) a b J a b b a b ≤  =  > 

slide-14
SLIDE 14

Exercise (Homework)

  • Determine whether or not the HS holds for

the case presented in the previous slide

  • Use the Lukasiewicz’s implication