PART 8 Approximate Reasoning 1. Fuzzy expert systems 2. Fuzzy implications 3. Selecting fuzzy implications 4. Multiconditional reasoning 5. Fuzzy relation.

Slides:



Advertisements
Similar presentations
Discrete Mathematics Math 6A
Advertisements

Discrete Mathematics University of Jazeera College of Information Technology & Design Khulood Ghazal Mathematical Reasoning Methods of Proof.
Introduction to Proofs
5.1 Real Vector Spaces.
Rules of Inferences Section 1.5. Definitions Argument: is a sequence of propositions (premises) that end with a proposition called conclusion. Valid Argument:
1 Section 1.5 Rules of Inference. 2 Definitions Theorem: a statement that can be shown to be true Proof: demonstration of truth of theorem –consists of.
February 26, 2015Applied Discrete Mathematics Week 5: Mathematical Reasoning 1 Addition of Integers Example: Add a = (1110) 2 and b = (1011) 2. a 0 + b.
Computational Intelligence Winter Term 2010/11 Prof. Dr. Günter Rudolph Lehrstuhl für Algorithm Engineering (LS 11) Fakultät für Informatik TU Dortmund.
Chapter 2 Fundamentals of Logic Dept of Information management National Central University Yen-Liang Chen.
CS344 : Introduction to Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 9,10,11- Logic; Deduction Theorem 23/1/09 to 30/1/09.
Chapter 1: The Foundations: Logic and Proofs 1.1 Propositional Logic 1.2 Propositional Equivalences 1.3 Predicates and Quantifiers 1.4 Nested Quantifiers.
CLASSICAL LOGIC and FUZZY LOGIC. CLASSICAL LOGIC In classical logic, a simple proposition P is a linguistic, or declarative, statement contained within.
Fuzzy Sets and Applications Introduction Introduction Fuzzy Sets and Operations Fuzzy Sets and Operations.
Chapter 3. Mathematical Reasoning 3.1 Methods of proof A theorem is a statement that can be shown to be true. A proof is to demonstrate that a theorem.
Fuzzy Logic Frank Costanzo – MAT 7670 Spring 2012.
2009/91 Methods of Proof (§1.7) Methods of mathematical argument (proof methods) can be formalized in terms of rules of logical inference. Mathematical.
Logic 3 Tautological Implications and Tautological Equivalences
PART 2 Fuzzy sets vs crisp sets
Laws of , , and  Excluded middle law Contradiction law P   P  T P   P  F NameLaw Identity laws P  F  P P  T  P Domination laws P  T  T P.
Logic and Proof. Argument An argument is a sequence of statements. All statements but the first one are called assumptions or hypothesis. The final statement.
Linguistic Descriptions Adriano Joaquim de Oliveira Cruz NCE e IM/UFRJ © 2003.
Theory and Applications
TR1413: Discrete Mathematics For Computer Science Lecture 4: System L.
PART 3 Operations on fuzzy sets
Proof by Deduction. Deductions and Formal Proofs A deduction is a sequence of logic statements, each of which is known or assumed to be true A formal.
Ming-Feng Yeh General Fuzzy Systems A fuzzy system is a static nonlinear mapping between its inputs and outputs (i.e., it is not a dynamic system).
Chapter 7 Reasoning about Knowledge by Neha Saxena Id: 13 CS 267.
Fall 2002CMSC Discrete Structures1 Let’s proceed to… Mathematical Reasoning.
Fuzzy Sets and Fuzzy Logic Theory and Applications
Fuzzy Logic Jan Jantzen Logic is based on set theory, and when we switch to fuzzy sets it will have an effect on.
First Order Logic. This Lecture Last time we talked about propositional logic, a logic on simple statements. This time we will talk about first order.
February 25, 2002Applied Discrete Mathematics Week 5: Mathematical Reasoning 1 Addition of Integers How do we (humans) add two integers? Example: 7583.
A Brief Summary for Exam 1 Subject Topics Propositional Logic (sections 1.1, 1.2) –Propositions Statement, Truth value, Proposition, Propositional symbol,
1 Georgia Tech, IIC, GVU, 2006 MAGIC Lab Rossignac Lecture 03: PROOFS Section 1.5 Jarek Rossignac CS1050: Understanding.
1 On one-generated projective BL-algebras Antonio Di Nola and Revaz Grigolia University of Salerno Tbilisi State University Department of Mathematics Institute.
MATH 224 – Discrete Mathematics
Proofs1 Elementary Discrete Mathematics Jim Skon.
1 Sections 1.5 & 3.1 Methods of Proof / Proof Strategy.
1 Math/CSE 1019C: Discrete Mathematics for Computer Science Fall 2011 Suprakash Datta Office: CSEB 3043 Phone: ext
Discrete Structures (DS)
From Truth Tables to Rules of Inference Using the first four Rules of Inference Modus Ponens, Modus Tollens, Hypothetical Syllogism and Disjunctive Syllogism.
Theory and Applications
Lecture 3 Fuzzy Reasoning 1. inference engine core of every fuzzy controller the computational mechanism with which decisions can be inferred even though.
1 Introduction to Abstract Mathematics Chapter 2: The Logic of Quantified Statements. Predicate Calculus Instructor: Hayk Melikya 2.3.
CS6133 Software Specification and Verification
1 Discrete Structures – CNS2300 Text Discrete Mathematics and Its Applications Kenneth H. Rosen (5 th Edition) Chapter 3 The Foundations: Logic and Proof,
Chap 3: Fuzzy Rules and Fuzzy Reasoning J.-S. Roger Jang ( 張智星 ) CS Dept., Tsing Hua Univ., Taiwan Fuzzy.
Artificial Intelligence “Introduction to Formal Logic” Jennifer J. Burg Department of Mathematics and Computer Science.
Lecture 32 Fuzzy Set Theory (4)
Ch.3 Fuzzy Rules and Fuzzy Reasoning
Foundations of Discrete Mathematics Chapter 1 By Dr. Dalia M. Gil, Ph.D.
Chapter 1, Part III: Proofs With Question/Answer Animations Copyright © McGraw-Hill Education. All rights reserved. No reproduction or distribution without.
Sound Arguments and Derivations. Topics Sound Arguments Derivations Proofs –Inference rules –Deduction.
Chapter 3: Fuzzy Rules & Fuzzy Reasoning Extension Principle & Fuzzy Relations (3.2) Fuzzy if-then Rules(3.3) Fuzzy Reasonning (3.4)
Nonfinite basicity of one number system with constant Almaz Kungozhin Kazakh National University PhD-student ACCT 2012, June
Keywords (ordinary/partial) differencial equation ( 常 / 偏 ) 微分方程 difference equation 差分方程 initial-value problem 初值问题 convex 凸的 concave 凹的 perturbed problem.
Mathematical basics for general fuzzy systems
Chapter 3 The Real Numbers.
From Classical Proof Theory to P vs. NP
Methods of proof Section 1.6 & 1.7 Wednesday, June 20, 2018
Advanced Algorithms Analysis and Design
Fuzzy Logic and Approximate Reasoning
Proof Techniques.
CLASSICAL LOGIC and FUZZY LOGIC
7.1 Rules of Implication I Natural Deduction is a method for deriving the conclusion of valid arguments expressed in the symbolism of propositional logic.
CS 220: Discrete Structures and their Applications
Advanced Analysis of Algorithms
Mathematical Induction
Algebra I Solving Equations (1, 2, multi-step)
Rules of inference Section 1.5 Monday, December 02, 2019
Presentation transcript:

PART 8 Approximate Reasoning 1. Fuzzy expert systems 2. Fuzzy implications 3. Selecting fuzzy implications 4. Multiconditional reasoning 5. Fuzzy relation equations 6. Interval-valued reasoning FUZZY SETS AND FUZZY LOGIC Theory and Applications

2 Fuzzy expert systems

Fuzzy implications Extensions of classical implications: 3

Fuzzy implications S-implications 1.Kleene-Dienes implication 2.Reichenbach implication 3.Lukasiewicz implication 4

Fuzzy implications S-implications 4.Largest S-implication 5

Fuzzy implications Theorem 8.1 6

Fuzzy implications R-implications 1.Gödel implication 2.Goguen implication 7

Fuzzy implications R-implications 3.Lukasiewicz implication 4.the limit of all R-implications 8

Fuzzy implications Theorem 8.2 9

Fuzzy implications QL-implications 1.Zadeh implication 2. When i is the algebraic product and u is the algebraic sum. 10

Fuzzy implications QL-implications 3. When i is the bounded difference and u is the bounded sum, we obtain the Kleene-Dienes implication. 4. When i = i min and u = u max 11

Fuzzy implications Combined ones 12

Fuzzy implications Axioms of fuzzy implications 13

Fuzzy implications Axioms of fuzzy implications 14

Fuzzy implications Axioms of fuzzy implications 15

Fuzzy implications Theorem

Selecting fuzzy implications Generalized modus ponens any fuzzy implication suitable for approximate reasoning based on the generalized modus ponens should satisfy (8.13) for arbitrary fuzzy sets A and B. 17

Selecting fuzzy implications Theorem

Selecting fuzzy implications Theorem

Selecting fuzzy implications Generalized modus tollens Generalized hypothetical syllogism 20

Multiconditional reasoning general schema of multiconditional approximate reasoning The method of interpolation is most common way to determine B‘. It consists of the following two steps: 21

Multiconditional reasoning 22

Multiconditional reasoning 23

Multiconditional reasoning four possible ways of calculating the conclusion B': Theorem

Fuzzy relation equations Suppose now that both modus ponens and modus tollens are required. The problem of determining R becomes the problem of solving the following system of fuzzy relation equation: 25

Fuzzy relation equations Theorem 8.7

Fuzzy relation equations If then is also the greatest approximate solution to the system (8.30). 27

Fuzzy relation equations Theorem 8.8

Interval-valued reasoning Let A denote an interval-valued fuzzy set. L A,U A are fuzzy sets called the lower bound and the upper bound of A. A shorthand notation of A( x ) When L A = U A, A becomes an ordinary fuzzy set. 29

Interval-valued reasoning given a conditional fuzzy proposition (if - then rule) where A, B are interval-valued fuzzy sets defined on the universal sets X and Y. given a fact how can we derive a conclusion in the form 30

Interval-valued reasoning view this conditional proposition as an interval- valued fuzzy relation R = [L R,U R ], where It is easy to prove that L R (x, y) ≦ U R (x, y) and, hence, R is well defined. 31

Interval-valued reasoning Once relation R is determined, it facilitates the reasoning process. Given A’ = [L A’,U A’ ], we derive a conclusion B’ = [L B’,U B’ ] by the compositional rule of inference where i is a t-norm and 32

Interval-valued reasoning Example let a proposition be given, where Assuming that the Lukasiewicz implication 33

Interval-valued reasoning

Exercise