Fuzzy Rules and Fuzzy Reasoning (chapter 3)

Similar documents
Fuzzy Rules and Fuzzy Reasoning (chapter 3)

Fuzzy Rules and Fuzzy Reasoning. Chapter 3, Neuro-Fuzzy and Soft Computing: Fuzzy Rules and Fuzzy Reasoning by Jang

Fuzzy Rules & Fuzzy Reasoning

Fuzzy Controller. Fuzzy Inference System. Basic Components of Fuzzy Inference System. Rule based system: Contains a set of fuzzy rules

Outline. Introduction, or what is fuzzy thinking? Fuzzy sets Linguistic variables and hedges Operations of fuzzy sets Fuzzy rules Summary.

Rule-Based Fuzzy Model

Fuzzy Expert Systems Lecture 6 (Fuzzy Logic )

Faster Adaptive Network Based Fuzzy Inference System

Classical Set Theory. Outline. Classical Set Theory. 4. Linguistic model, approximate reasoning. 1. Fuzzy sets and set-theoretic operations.

Instructor: Shihua Li School of Automation Southeast university

What is Fuzzy Logic? Fuzzy logic is a tool for embedding human knowledge (experience, expertise, heuristics) Fuzzy Logic

So, we can say that fuzzy proposition is a statement p which acquires a fuzzy truth value T(p) ranges from(0 to1).

It rains now. (true) The followings are not propositions.

Lecture 1: Introduction & Fuzzy Control I

Two conventions for coordinate systems. Left-Hand vs Right-Hand. x z. Which is which?

Propositional Logic: Review

MATRIX TRANSFORMATIONS

Fuzzy control systems. Miklós Gerzson

Unit 12 Study Notes 1 Systems of Equations

Logic. Introduction to Artificial Intelligence CS/ECE 348 Lecture 11 September 27, 2001

Linear and Angular Velocities 2/4. Instructor: Jacob Rosen Advanced Robotic - MAE 263D - Department of Mechanical & Aerospace Engineering - UCLA

Additional Material On Recursive Sequences

AE/ME 339. K. M. Isaac Professor of Aerospace Engineering. December 21, 2001 topic13_grid_generation 1

Nonlinear Function Approximation Using Fuzzy Functional SIRMs Inference Model

The approximation of piecewise linear membership functions and Łukasiewicz operators

Fundamentals. 2.1 Fuzzy logic theory

The Sigmoidal Approximation of Łukasiewicz Operators

Handling Uncertainty using FUZZY LOGIC

Computational Intelligence Lecture 13:Fuzzy Logic

Chapter 3: Propositional Calculus: Deductive Systems. September 19, 2008

14.1 Systems of Linear Equations in Two Variables

Computational Intelligence Lecture 6:Fuzzy Rule Base and Fuzzy Inference Engine

Section 2.2 Set Operations. Propositional calculus and set theory are both instances of an algebraic system called a. Boolean Algebra.

8. BOOLEAN ALGEBRAS x x

Vectors and the Geometry of Space

CHAPTER 2: Partial Derivatives. 2.2 Increments and Differential

cse371/mat371 LOGIC Professor Anita Wasilewska Fall 2018

An Information Theory For Preferences

Financial Informatics XI: Fuzzy Rule-based Systems

Discrete Structures of Computer Science Propositional Logic III Rules of Inference

9.2. Cartesian Components of Vectors. Introduction. Prerequisites. Learning Outcomes

Chapter Adequacy of Solutions

Logical Agents. September 14, 2004

Knowledge-based systems

2. The Logic of Compound Statements Summary. Aaron Tan August 2017

Natural Deduction is a method for deriving the conclusion of valid arguments expressed in the symbolism of propositional logic.

2D Wavelets. Gloria Menegaz 1

MAT389 Fall 2016, Problem Set 2

Foundations of Databases

Systems of Linear Equations: Solving by Graphing

Uncertainty and Rules

EEE 8005 Student Directed Learning (SDL) Industrial Automation Fuzzy Logic

Simlification of Switching Functions

Artificial Intelligence. Propositional logic

12.1 Systems of Linear equations: Substitution and Elimination

The proposition p is called the hypothesis or antecedent. The proposition q is called the conclusion or consequence.

Decision tables and decision spaces

Three Profound Theorems about Mathematical Logic

Vector Calculus Review

Module 3, Section 4 Analytic Geometry II

4.7. Newton s Method. Procedure for Newton s Method HISTORICAL BIOGRAPHY

Uncertain Systems are Universal Approximators

7. Logical Agents. COMP9414/ 9814/ 3411: Artificial Intelligence. Outline. Knowledge base. Models and Planning. Russell & Norvig, Chapter 7.

Intro. ANN & Fuzzy Systems. Lec 34 Fuzzy Logic Control (II)

03 Propositional Logic II

Fuzzy Logic. An introduction. Universitat Politécnica de Catalunya. Departament de Teoria del Senyal i Comunicacions.

is implemented by a fuzzy relation R i and is defined as

Chapter 1 Similarity Based Reasoning Fuzzy Systems and Universal Approximation

RELATIONS AND FUNCTIONS through

Inclusion Relationship of Uncertain Sets

One Solution Two Solutions Three Solutions Four Solutions. Since both equations equal y we can set them equal Combine like terms Factor Solve for x

Some linear transformations on R 2 Math 130 Linear Algebra D Joyce, Fall 2013

Functions 3: Compositions of Functions

Hadi s Method and It s Advantage in Ranking Fuzzy Numbers

Fuzzy logic Fuzzyapproximate reasoning

Venn Diagrams for Boolean Algebra

Hamidreza Rashidy Kanan. Electrical Engineering Department, Bu-Ali Sina University

CSCE 222 Discrete Structures for Computing. Review for Exam 1. Dr. Hyunyoung Lee !!!

Logic, Human Logic, and Propositional Logic. Human Logic. Fragments of Information. Conclusions. Foundations of Semantics LING 130 James Pustejovsky

APPENDIX D Rotation and the General Second-Degree Equation

INF5390 Kunstig intelligens. Logical Agents. Roar Fjellheim

Natural Deduction. Formal Methods in Verification of Computer Systems Jeremy Johnson

Green s Theorem Jeremy Orloff

Fuzzy Sets and Systems. Lecture 4 (Fuzzy Logic) Bu- Ali Sina University Computer Engineering Dep. Spring 2010

Handout for Adequacy of Solutions Chapter SET ONE The solution to Make a small change in the right hand side vector of the equations

The Importance of Being Formal. Martin Henz. February 5, Propositional Logic

CONTINUOUS SPATIAL DATA ANALYSIS

SOLVING QUADRATICS. Copyright - Kramzil Pty Ltd trading as Academic Teacher Resources

Fuzzy Systems, Modeling and Identification

1. Brief History of Intelligent Control Systems Design Technology

Knowledge base (KB) = set of sentences in a formal language Declarative approach to building an agent (or other system):

Outline. On Premise Evaluation On Conclusion Entailment. 1 Imperfection : Why and What. 2 Imperfection : How. 3 Conclusions

Semantics for Propositional Logic

In applications, we encounter many constrained optimization problems. Examples Basis pursuit: exact sparse recovery problem

Section 3.1. ; X = (0, 1]. (i) f : R R R, f (x, y) = x y

CVAR REDUCED FUZZY VARIABLES AND THEIR SECOND ORDER MOMENTS

Framing human inference by coherence based probability logic

Where are we? Operations on fuzzy sets (cont.) Fuzzy Logic. Motivation. Crisp and fuzzy sets. Examples

Chapter 1, Logic and Proofs (3) 1.6. Rules of Inference

Inference in Propositional Logic

Transcription:

9/4/00 Fuzz ules and Fuzz easoning (chapter ) Kai Goebel, ill Cheetham GE Corporate esearch & Development goebel@cs.rpi.edu cheetham@cs.rpi.edu (adapted from slides b. Jang) Fuzz easoning: The ig Picture Useful for: utomatic Control Epert Sstems Pattern ecognition Time Series Prediction Data Classification There are different schemes to accomplish these goals depending on our understanding and boundar conditions of the world. Etending: crisp domains to fuzz domains: Etension Principle n-ar fuzz relations: Fuzz elations fuzz domains to fuzz domains: Fuzz Inference (fuzz rules, compositional rules of inference) Outline Etension principle Fuzz relations Fuzz IF-THEN rules Compositional rule of inference Fuzz reasoning Etension Principle Etends crisp domains of mathematical epressions to fuzz domains is a fuzz set on : = ( ) / + ( ) / + + ( ) / n n The image of under f is a fuzz set :, i.e., =f() = ( ) / + ( ) / + + ( ) / n n where i = f(i), i = to n. 4 If f is a man-to-one mapping, then ( ) = ma ( ) = f ( ) Etension Principle: Eample =0./-+0.4/-+0.8/0+0.9/+0./ Etension Principle, continuous vars. ( ) = bell( ;. 5,, 0. 5) and ( ) if 0 f = if < 0 f()= - =0./+0.4/-+0.8/-+0.9/-+0./ =0.8/-+(0.4v0.9)/-+(0.v0.)/ =0.8/-+0.9/-+0./ 5 6 Page

9/4/00 Fuzz elations Ma-Min Composition 7 fuzz relation is a D MF: = {((, ), (, )) (, ) } Eamples: depends on ( and are events) If is large, then is small ( is an observed reading and is a corresponding action) is much greater than ( and are numbers) (, ) = + + if 0 if < If ={,4,5} and ={,4,5,6,7} Epress fuzz relation as a relation matri 0 0. 0. 0 0. 7 0. = 0 0 0. 0 9 0. 7 0. 0 0 0 0. 0 8 0. 4 8 The ma-min composition of two fuzz relations (defined on and ) and (defined on and ) is (, z ) = [ (, ) (, z ) Note: calculation ver similar to matri multiplication Properties: ssociativit: ( S T ) = ( S ) T Distributivit over union: ( S T ) = ( S ) ( T ) Week distributivit over intersection: ( S T ) ( S ) ( T ) Monotonicit: S T ( S ) ( T ) Ma-min Composition: Eample Ma-min Composition: Eample = is relevant to = is relevant to z where 0. 0. 0. 5 0. 7 = 0. 4 0. 0. 8 0. 9 0. 6 0. 8 0. 0. ={ 0. 9 0. 0. 0. = 0. 5 0. 6 0. 7 0. } ={a b} Calculate: is relevant to a 0. 0. 0. 5 0. 7 = 0. 4 0. 0. 8 0. 9 ={ 0. 6 0. 8 0. 0. } 0. 7 0. ={a b} 0. 9 0. 0. 0. = 0. 5 0. 6 (, ) =, m a 0. 4 0. 9, 0. 0., 0. 8 0. 5, 0. 9 0. 7 a ( a) = ( ) 9 0 Ma-Star Composition Ma-product composition: (, ) [ (, ) (, ) z = z In general, we have ma-* composition: (, z ) = [ (, ) * where * is a T-norm operator. (, z ) Even more generall, we have (S-norm)-(T-norm) compositions Linguistic Variables (knowledge rep.) Precision vs. significance numerical variable can take on numerical (ge = 65) or linguistic values (ge is old) linguistic value is characterized b the variable name (age) a fuzz set. ll linguistic values form a term set: T(age) = {oung, not oung, ver oung,... middle aged, not middle aged,... old, not old, ver old, more or less old,... not ver oung and not ver old,...} The sntactic rule refers to how the linguistic values are generated. The semantic rule defines the membership value of each linguistic variable. Page

9/4/00 Linguistic Values (Terms) Operations on Linguistic Values Concentration: Dilation: Contrast Intensification: CON = DIL = 0.5,. INT = 0 05 ( ), 05. 4 Fuzz IF-THEN ules General format: IF is THEN is if <antecedent> then <consequent> Eamples: IF pressure is high THEN volume is small. IF the road is slipper THEN driving is dangerous. IF a tomato is red THEN it is ripe. IF the speed is high THEN appl the brake a little. Fuzz IF-THEN ules Two was to interpret IF is THEN is : coupled with entails 5 6 Fuzz If-Then ules Two was to interpret If is then is : coupled with : ( and ) = = = ( ) ~ ( ) (, ) entails : (not or ) - Material implication Fuzz IF-THEN ules Fuzz implication function: (, ) = f (, ) = f ( a, b) coupled with - Propositional calculus ( ) 7 - Etended propositional calculus ( ) - Generalization of modus ponens ~, = su p c * c a n d 0 c { } Note: these all reduce to not or in two-valued logic (, ) = min(, ) 8 (, ) = (, ) = 0 ( + ) ( ) if =, = if = 0 otherwise Page

9/4/00 Fuzz IF-THEN ules coupled with = bell ; 4,, 0 = bell ; 4,, 0 Fuzz IF-THEN ules entails (not an ehaustive list) min algebraic product bounded product drastic product ( ) ( ( ) (, ) = ma min,, ) (, ) = min, + (, ) = min, ( (, ) = ma, 9 0 Fuzz IF-THEN ules Compositional ule of Inference entails = bell ; 4,, 0 = bell ; 4,, 0 Same idea as ma-min composition Derivation of = b from = a and = f(): b b adeh s arithmetic rule adeh s ma-min rule oolean Fuzz Implication Gougen s Fuzz Impl. = f() = f() a a and b: points = f() : a curve a a and b: intervals = f() : an interval-valued function Compositional ule of Inference, contd. ecall: Clindrical Etension To find the resulting interval =b (which corresponds to =a) construct a clindrical etension of a find intersection with curve project intersection to -ais ase set Clindrical Et. of c (, ) = 4 Page 4 4

9/4/00 ecall: D MF Projection Compositional ule of Inference Two-dimensional MF Projection onto Projection onto a is a fuzz set and = f() is a fuzz relation: 5 (, ) = = ma (, ) ma (, ) 6 Putting it together: Comp. rule of Inf. Clindrical etension with base c (, ) = Intersection of c() with F (, ) = min (, ), c F c F (, ) = min, (, ) [ [ F Projection onto -ais = ma min [, F (, ) = [ F (, ) Crisp easoning Modus Ponens: Fact: is ule: IF is THEN is Conclusion: is 7 epresentation: = F Note relation to etension principle 8 Fuzz easoning Single rule with single antecedent Fact: is ule: if is then is Conclusion: is (Generalized Modus Ponens) Graphic epresentation: F - Single ule, Single ntecedent Graphical epresentation: - find degree of match w between () and () intuitivel: degree of belief for antecedent which gets propagated; result should be not greater than w w 9 0 is is Page 5 5

9/4/00 Fuzz easoning: Single ntecedent Fuzz easoning,, and be fuzz sets of,, and, respectivel. ssumption: the fuzz implication -> is epressed as a fuzz relation on The fuzz set induced b fact: is and premise: IF is then is = ma min [, (, ) = (, ) or: [ = = ( ) Single rule with multiple antecedents Facts: is and is ule: if is and is then z is C Conclusion: z is C [ [ [ C z, { [ } [ ( z) = z, C C = C = [ ( C) [ ( C) { } C = z w w F - Single ule, Multiple ntecedents Fuzz easoning Graphical epresentation - w denotes degree of compatibilit between and and w between and - w w is degree of fulfilment of the rule T-norm C v w w w Multiple rules with multiple antecedent Fact: is and is ule : if is and is then z is C ule : if is and is then z is C Conclusion: z is C Graphic epresentation: (net slide) C is is z is C 4 Fuzz easoning Graphics representation: C w C w last slide T-norm C is is z is C 5 6 Page 6 6