Material Covered in Lecture #3

Recap of Lecture #2

Generalized Modus Ponens

1. Numerical Example
2. Three possible implementations of Modus Ponens
3. Computational Issues
   • Storage Complexity
   • Debugging with lambda values
   • Performance (proportion of active rules)

Extension Principle

1. Extension Principle: Theory and Implementation
2. Representation: Discrete (Sampling) and Parametrized
3. Fuzzy numbers
4. Interval and fuzzy arithmetics
5. Table of Close-formed Formulae for convex normal fuzzy numbers
   • Conditions of applicability
   • Assumptions for closure
6. Algebraic properties of positive normal convex fuzzy numbers (commutative semi-ring)

Author: Piero P. Bonissone bonissone@crd.ge.com