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

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

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

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

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

Fuzzy Expert Systems Lecture 6 (Fuzzy Logic )

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

3. The Logic of Quantified Statements Summary. Aaron Tan August 2017

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

PROPOSITIONAL CALCULUS

Rule-Based Fuzzy Model

Introduction to fuzzy logic

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

Predicate Logic. Andreas Klappenecker

Computational Intelligence Lecture 13:Fuzzy Logic

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

Review for Midterm 1. Andreas Klappenecker

A Quick Lesson on Negation

Computational Intelligence Winter Term 2017/18

CS100: DISCRETE STRUCTURES. Lecture 5: Logic (Ch1)

COMP 182 Algorithmic Thinking. Proofs. Luay Nakhleh Computer Science Rice University

Propositional Logic: Review

MACM 101 Discrete Mathematics I. Exercises on Predicates and Quantifiers. Due: Tuesday, October 13th (at the beginning of the class)

Logic Overview, I. and T T T T F F F T F F F F

CHAPTER 1 - LOGIC OF COMPOUND STATEMENTS

PHI Propositional Logic Lecture 2. Truth Tables

Index Terms Vague Logic, Linguistic Variable, Approximate Reasoning (AR), GMP and GMT

Proofs. Example of an axiom in this system: Given two distinct points, there is exactly one line that contains them.

Logic. Propositional Logic: Syntax

CSC Discrete Math I, Spring Propositional Logic

Fuzzy Rules and Fuzzy Reasoning (chapter 3)

Valid Reasoning. Alice E. Fischer. CSCI 1166 Discrete Mathematics for Computing February, Outline Truth and Validity Valid Reasoning

Logic and Proof. Aiichiro Nakano

Propositional Calculus - Hilbert system H Moonzoo Kim CS Division of EECS Dept. KAIST

Review 1. Andreas Klappenecker

Math.3336: Discrete Mathematics. Nested Quantifiers/Rules of Inference

Selecting the most Appropriate Fuzzy Implication based on Statistical Data

Propositional Logic. Spring Propositional Logic Spring / 32

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

ICS141: Discrete Mathematics for Computer Science I

Logic. Definition [1] A logic is a formal language that comes with rules for deducing the truth of one proposition from the truth of another.

1 The Foundation: Logic and Proofs

Today s Lecture 2/25/10. Truth Tables Continued Introduction to Proofs (the implicational rules of inference)

Fuzzy expert systems

CSCE 222 Discrete Structures for Computing. Predicate Logic. Dr. Hyunyoung Lee. !!!!! Based on slides by Andreas Klappenecker

Fuzzy and Rough Sets Part I

Packet #1: Logic & Proofs. Applied Discrete Mathematics

15414/614 Optional Lecture 1: Propositional Logic

Logic, Sets, and Proofs

Formal Logic. Critical Thinking

1 The Foundation: Logic and Proofs

Discrete Mathematical Structures: Theory and Applications

Deductive and Inductive Logic

Packet #2: Set Theory & Predicate Calculus. Applied Discrete Mathematics

Steinhardt School of Culture, Education, and Human Development Department of Teaching and Learning. Mathematical Proof and Proving (MPP)

Analyzing Arguments with Truth Tables

Rules Build Arguments Rules Building Arguments

Advanced Topics in LP and FP

Introduction Logic Inference. Discrete Mathematics Andrei Bulatov

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

MACM 101 Discrete Mathematics I. Exercises on Propositional Logic. Due: Tuesday, September 29th (at the beginning of the class)

n logical not (negation) n logical or (disjunction) n logical and (conjunction) n logical exclusive or n logical implication (conditional)

Logical Agents. September 14, 2004

Propositional Logic: Syntax

HANDOUT AND SET THEORY. Ariyadi Wijaya

MAT 243 Test 1 SOLUTIONS, FORM A

EECS 1028 M: Discrete Mathematics for Engineers

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

Artificial Intelligence. Propositional logic

software design & management Gachon University Chulyun Kim

5. And. 5.1 The conjunction

Framing human inference by coherence based probability logic

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

Propositional Logic. Fall () Propositional Logic Fall / 30

CPSC 121: Models of Computation. Module 6: Rewriting predicate logic statements

Methods of Proof. 1.6 Rules of Inference. Argument and inference 12/8/2015. CSE2023 Discrete Computational Structures

Discrete Structures & Algorithms. Propositional Logic EECE 320 // UBC

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

On Hájek s Fuzzy Quantifiers Probably and Many

Motivation. From Propositions To Fuzzy Logic and Rules. Propositional Logic What is a proposition anyway? Outline

Chapter 1 Elementary Logic

Fundamentals. 2.1 Fuzzy logic theory

Today s s lecture. Lecture 16: Uncertainty - 6. Dempster-Shafer Theory. Alternative Models of Dealing with Uncertainty Information/Evidence

Review: Potential stumbling blocks

This time: Fuzzy Logic and Fuzzy Inference

ECOM Discrete Mathematics

Maryam Al-Towailb (KSU) Discrete Mathematics and Its Applications Math. Rules Math. of1101 Inference 1 / 13

Intro to Logic and Proofs

Solutions to Sample Problems for Midterm

Lecture 1: Introduction & Fuzzy Control I

CSE 20 DISCRETE MATH. Fall

2. Use quantifiers to express the associative law for multiplication of real numbers.

The Logic of Compound Statements cont.

Logic. Logic is a discipline that studies the principles and methods used in correct reasoning. It includes:

cse 311: foundations of computing Fall 2015 Lecture 6: Predicate Logic, Logical Inference

CS344: Introduction to Artificial Intelligence (associated lab: CS386)

Discrete Structures for Computer Science

Uncertainty and Rules

MCS-236: Graph Theory Handout #A4 San Skulrattanakulchai Gustavus Adolphus College Sep 15, Methods of Proof

Handling Uncertainty using FUZZY LOGIC

Propositional Logic Not Enough

Transcription:

Chapter 4 Fuzzy Proposition Main difference between classical proposition and fuzzy proposition is in the range of their truth values. The proposition value for classical proposition is either true or false but in case of fuzzy proposition the range is not confined to only two values it varies from 2 to n. For example speed may be fast, very fast, medium, slow, and very slow. In fuzzy logic the truth value of fuzzy proposition is also depend on an additional factor known as degree of truth whose value is varies between 0 and 1. For example p: Speed is Slow T(p) = 0.8, if p is partly true T(p) = 1, if p is absolutely true T(p) = 0, if p is totally false So, we can say that fuzzy proposition is a statement p which acquires a fuzzy truth value T(p) ranges from(0 to1). Different types of Fuzzy Propositions 1. Unconditional and unqualified propositions p:v is F Where, V is a variable which takes value v from a universal set U. F is a fuzzy set on U that represents a given inaccurate predicate such as fast, low, tall etc. For example: p: Speed (V) is high (F) T(p) = 0.8, if p is partly true T(p)=1, if p is absolutely true T(p)=0, if p is totally false Where, T(p) = µ F (v) membership grade function indicates the degree of truth of v belongs to F, its value ranges from 0 to 1. 2. Unconditional and qualified propositions p:v is F is S Where, V and F have the same meaning and S is a fuzzy truth qualifier Speed is high is very true 3. Conditional and unqualified propositions p: if X is A, then Y is B 1

Where, X, Y are variables in universes U1 and U2 A, B are fuzzy sets on X, Y p: if speed is High, then risk is Low 4. Conditional and Qualified Propositions p: (if X is A, then Y is B) is S Where, all variables have same meaning as previous declare p: if speed is high than risk is low is true. Fuzzy implication Consider the implication statement if pressure is high then volume is small The membership function of the fuzzy set A, big pressure, illustrated in the figure 2

The membership function of the fuzzy set B, small volume, can be interpreted as (see figure) If p: x is A Where A is a fuzzy set, for example, big pressure And q: y is B For example, small volume Then we define the fuzzy implication A B as a fuzzy relation. IF X is A than Y is B, can be represent by relation Where, A and B are two fuzzy sets with membership function µ A and µ B respectively And Y is universe of discourse same as B but membership value for all is1. The membership function of R is given by μ, max min μ,μ,1 μ If X is A than Y is B Now, suppose X = {a,b,c} Y = {1,2,3} A = { (a,0) (b,0.5) (c,1) } B = { (1,1) (2,0.3) (3,0.8)} 3

1 2 3 a 0 0 0 A X B = b 0.5 0.3 0.5 c 1 0.3 0.8 1 2 3 a 1 1 1 X B = b 0.5 0.5 0.5 c 0 0 0 1 2 3 a 1 1 1 R = b 0.5 0.5 0.5 c 1 0.3 0.8 Fuzzy Inference Fuzzy inference is the process of obtaining new knowledge through existing knowledge. Knowledge is most commonly represent in the form of rules or proposition for example if x is A then y is B (Where A and B are linguistic values defined by fuzzy sets on universes of discourse X and Y). A rule is also called a fuzzy implication. x is A is called the antecedent or premise and y is B is called the consequence or conclusion. The two important inferring processes are Generalized modus Ponens (GMP) Generalized modus Tollens (GMT) GMP p: If X is A than Y is B (Analytically known) q: If X is A (Analytically known) than Y is B (Analytically unknown) Where, A, B, A, B are fuzzy terms. A and B are some predicate with different linguistic hedges. To compute the membership function of B the min max composition of fuzzy set A with R(x,y) which is known as implication rule is used., In terms of membership function μ max min μ,μ, where µ B (y), µ A (A ), µ R (x,y) are membership function of B, A and implication relation respectively. 4

GMT p: If X is A than Y is B (Analytically known) q: If Y is B (Analytically known) than X is A (Analytically unknown) Where, A, B, A, B are fuzzy terms., In terms of membership function μ max min μ,μ, where µ B (y), µ A (A ), µ R (x,y) are membership function of B, A and implication relation respectively. Let us consider the following logical implication, p: If Force is huge, acceleration is large q: If Force is huge Acceleration is large Let L(Large), VL(Very Large), H(Huge), VH(Very Huge) indicate the associate fuzzy variable sets. Now let us also assume, Force, X = {1, 2, 3, 4, 5, 6} Acceleration, Y= {10, 20, 30, 40, 50} L = {(3, 0.9), (4, 1), (5, 0.3)} VL = {(5, 0.9), (6, 1)} H = {(20, 1), (30, 0.6)} VH = {(10, 1), (20, 0.3)} R(x, y) = max { S, } H L = 1 0 0 0 0 0 2 0 0 0 0 0 3 0 0.9 0.6 0 0 4 0 1 0.6 0 0 5 0 0.3 0.3 0 0 6 0 0 0 0 0 5

H Y = 1 1 1 1 1 1 2 1 1 1 1 1 3 0.2 0.2 0.2 0.2 0.2 4 0 0 0 0 0 5 0.6 0.6 0.6 0.6 0.6 6 1 1 1 1 1 R (x, y) = 1 1 1 1 1 1 2 1 1 1 1 1 3 0.2 0.9 0.6 0.2 0.2 4 0 1 0.5 0 0 5 0.6 0.6 0.6 0.6 0.6 6 1 1 1 1 1 Now we apply the composition rule, VL = VH R x, y 1 1 1 1 1 1 2 1 1 1 1 1 3 0.2 0.8 0.5 0.2 0.2 4 0 1 0.5 0 0 5 0.6 0.6 0.6 0.6 0.6 6 1 1 1 1 1 = [0.9 1 0 0 0 0] VL = [0.90.90.90.90.90.9] 6

References: 1. http://reference.wolfram.com/applications/fuzzylogic/manual/8.html 2. http://if.kaist.ac.kr/lecture/cs670/textbook 3. Introduction to ANN and Fuzzy System by Yu Hen Hu (2001) 7