Fuzzy Expert Systems Lecture 6 (Fuzzy Logic )
|
|
- Garey Freeman
- 6 years ago
- Views:
Transcription
1 Fuzzy Expert Systems Lecture 6 (Fuzzy Logic ) Unlike Classical Logic, Fuzzy Logic is concerned, in the main, with modes of reasoning which are approximate rather than exact L. A. Zadeh Lecture 6 صفحه
2 Summary of the previous lecture Fuzzy propositions are the building blocks of the statements in fuzzy logic while atomic fuzzy propositions are the building blocks of the compound fuzzy propositions Connectives are used to build compound fuzzy propositions using the atomic fuzzy propositions. while and is regarded as intersection, or is regarded as union and not is regarded as fuzzy complement. Lecture 6 صفحه 2
3 Lecture 6 Fuzzy If-Then Rules Human knowledge is represented in terms of fuzzy if-then rules. A fuzzy if then rule is a conditional statement expressed as IF <Fuzzy Proposition> THEN <Fuzzy Proposition> تالی Consequent مقدم Antecedent Lecture 6 صفحه 3
4 Interpretation of fuzzy if-then rules If-then rules are named implication If p THEN q In classical logic, implications are general in the sense that their truth value for each combination of the truth values of the propositions can be defined as in the following Table P q p T T F F q T F T F p_ q T F T T Lecture 6 صفحه 4
5 The truth value of the implication p q can be obtained using the following formula in classical logic P q (~p)vq (p q)v(~p) If we also accept that fuzzy implications are also global, we can extend the above formula in fuzzy logic as well. Consequently, we should use any t-norm t instead of the connective and any s-norm s instead of V and any of the fuzzy complements instead of ~ Lecture 6 صفحه 5
6 Implications can be regarded as relations IF x is A THEN y is B A fuzzy if then rule such as the above rule can be regarded as a fuzzy relation which relates each pairs of (x,y) to each other to some extent. The relation nature of such implication is obvious however, the remaining question is how to define the membership function of the relation : µ Q (x,y) (x,y) UxV Q: UxV [,] µ Q (x,y)=? Lecture 6 صفحه 6
7 Types of Implications IF <FP > THEN <FP 2 > Dienes-Rescher Implication: using complement: Basic Fuzzy Complement S-norm: maximum µ = µ using (~p)vq ( x, y) max[ ( x), ( y)] FP FP2 Q D µ Lukasiewicz Implication: using (~ complement: Basic Fuzzy Complement S-norm: Yager S-norm (~p)vq µ ( x, y) = min[, µ ( x) + µ ( y)] Q L FP FP2 Lecture 6 صفحه 7
8 Zadeh Implication: using (p q)v(~p) complement: S-norm: T-norm: Godel Implication: Basic Fuzzy Complement maximum ( Basic Fuzzy Union) min ( Basic Fuzzy Intersection) µ Q D ( x, y) = max[min( µ FP ( x), µ ( y)), ( x)] FP µ 2 FP µ if FP Q G ( x, y) = µ FP ( y) p 2 µ ( x) q ( p q) µ FP 2 ( y) otherwise q Lecture 6 صفحه 8
9 Mamdani Implication (most widely used in fuzzy systems and control} Some people believe that fuzzy if-then rules (in spite of classical ones which are global ) are local implications In the sense that p q has large truth value when both p and q have large truth values. In other words it is assumed that : IF <FP > then <FP 2 > IF <FP > then <FP 2 > ELSE <nothing> Comparing with classical logic it is written as: P q p q Lecture 6 صفحه 9
10 Types of Mamdani Implications Mamdani-Min Min Q MM µ Q MM x, y) =< FP > < FP2 >= min[ µ FP ( x), µ FP ( y)] ( 2 Mamdani-Product Q MP µ Q MP x, y) =< FP > < FP2 >= µ FP ( x). µ FP ( y) ( 2 Lecture 6 صفحه
11 Example: Godel Implication in 3 Valued Logic p q P q.5 Lecture 6 صفحه
12 Fuzzy Logic What is Logic: Study of methods and principles of reasoning where reasoning means obtaining new propositions from existing propositions Generalization of the 2 valued classical logic to a multi valued fuzzy logic allows us to perform approximate reasoning that is deducing imprecise conclusions (fuzzy propositions) from a collection of imprecise premises (fuzzy propositions) Lecture 6 صفحه 2
13 Existing Propositions Premises Reasoning New Propositions Conclusions Fuzzy Propositions Approximate Reasoning Fuzzy Propositions The ultimate goal of the fuzzy logic is to provide foundations for approximate reasoning with imprecise propositions using fuzzy set theory as the principle tool Lecture 6 صفحه 3
14 Classical Inference Rules Given two propositions p and p q, the truth of the propositions q should be inferred ( p ( p q) ) ) q Modus Ponens: Given two propositions Premise : x is A Premise 2: IF x is A THEN y is B Non Fuzzy Conclusion: y is B Lecture 6 صفحه 4
15 Modus Tollens Tollens: Given two propositions ~ ~q and p q, the truth of the propositions ~p should be inferred ( q ( p q)) p Premise : y is not B Premise 2: IF x is A THEN y is B Conclusion: x is not A Lecture 6 صفحه 5
16 Hypothetical Syllogism: Given two propositions p q and q r the truth of the proposition p r should be inferred. ( ( p q) ( q r) ) ( p p r) Premise : IF x is A THEN y is B Premise 2: IF y is B THEN z is C Conclusion: IF x is A THEN z is C Lecture 6 صفحه 6
17 Verification of Modus Ponens in 3 valued logic p q P q.5 p (p q) [p (p q)] q)] q Lecture 6 صفحه 7
18 Fundamental Principles in Fuzzy Logic To achieve the ultimate goal of fuzzy logic in providing foundations for approximate reasoning, the generalizations of the above inference rules are proposed and are called, generalized modus ponens, generalized modus tollens and generalized hypothetical syllogism. Lecture 6 صفحه 8
19 Generalized Modus Ponens Given two fuzzy propositions x x is A A and IF x is A THEN y is B The new fuzzy proposition y y is B B could be inferred. It is obvious that this rule has not any meaning unless we specify the membership function of B. B. It is desired to define B B such that the closer A to A, the closer B to B Premise : x is A A Premise 2: IF x is A THEN y is B Conclusion: y is B B Lecture 6 صفحه 9
20 Graphical Interpretation of GMP A A B B A B B B A? Lecture 6 صفحه 2
21 Intuitive criteria relating premises and conclusion in Generalized Modus Ponens P P2 P3 P4 P5 P6 P7 * Premise X is A X is very A X is very A X is morl A X is morl A X is not A X is not A Premise 2 Conclusion y is B y is very B y is B y is morl B y is B Unknown y is not B Note: morl = more or less Lecture 6 صفحه 2
22 Generalized Modus Tollens Given two fuzzy propositions y y is B B and IF x is A THEN y is B The new fuzzy proposition x x is A A could be inferred. It is obvious that this rule does not have any meaning unless we specify the membership function of A.. It is desired to define A such that the more difference between B and B results more difference between A and A. Premise : y is B B Premise 2: IF x is A THEN y is B Conclusion: x is A A Lecture 6 صفحه 22
23 Intuitive criteria relating premises and conclusion in Generalized Modus Tollens Premise y is not B y is not very B y is not morl B y is B y is B Premise 2 Conclusion x is not A x is not very A x is not morl A x is Unknown x is A Lecture 6 صفحه 23
24 Generalized Hypothetical Syllogism Given two fuzzy propositions IF x is A THEN y is B and IF y is B B THEN z is C The following fuzzy proposition could be inferred: IF x is A THEN z is C C such that: the closer B to B B, the closer C C to C Premise : IF x is A THEN y is B Premise 2: IF y is B B THEN z is C Conclusion: IF x is A THEN z is C C Lecture 6 صفحه 24
25 Graphical Interpretation of GHS A B B C A? C Lecture 6 صفحه 25
26 Intuitive criteria relating premises and conclusion in Generalized hypothetical syllogism s s2 s3 s4 s5 s6 s7 Premise Premise 2 IF y is B B z is C IF y is B z is C IF y is very B z is C IF y is very B z is C IF y is morl B z is C IF y is morl B z is C IF y is not B z is C IF y is not B z is C Conclusion IF x is A z is C z is morl C z is C z is very C z is C z is Unknow z is not C Lecture 6 صفحه 26
27 The above intuitive The above intuitive criteria are not necessarily true for a particular choice of fuzzy sets Fuzzy Propositions Inference Rules Fuzzy Propositions MF of the premises? MF of the conclusion Lecture 6 صفحه 27
28 Finding membership function of the conclusion Compositional Rule of Inference sup-star star composition Assume that A A is a fuzzy set in U having µ A (x) and Q is a fuzzy relation in UxV having µ Q (x,y), µ B (y)= sup xεu { t[ µ A (x), µ Q (x,y) ] } sup µ ( y) = [ µ ( x) * µ B A' x U Q ( x, y)] Lecture 6 صفحه 28
29 A x U Elements of U are related to elements of V through a relation Q. B y µ Q (x,y) So how this relation relates the fuzzy sets in U to fuzzy sets in V? How much y is B? V How much a desired x is related to this y AND how much that x is A Lecture 6 صفحه 29
30 How much y is B ( µ B (y)=?? ) (x is A ) and (x is related to y) t [ µ A (x) µ Q (x,y) ] Since different values of x may be related to a particular value of y, it is reasonable to look for the strongest relation when x is changed. µ B (y)= sup xεu {t[ µ A (x), µ Q (x,y) ] } Lecture 6 صفحه 3
31 Generalized Modus Ponens Premise : x is A A Premise 2: IF x is A THEN y is B Conclusion: y is B B µ B = µ µ ( y) sup t[ ( x), ( x, y)] ' x U A A B Lecture 6 صفحه 3
32 Generalized Modus Tollens Premise : y is B B Premise 2: IF x is A THEN y is B Conclusion: x is A A µ A = µ µ ( x) supt[ ( x), ( x, y)] ' y V B A B Lecture 6 صفحه 32
33 Generalized Hypothetical Syllogism Premise : IF x is A THEN y is B Premise 2: IF y is B B THEN z is C µ Conclusion: IF x is A THEN z is C C = µ µ A C A B B C y V ( x, z) supt[ ( x, y), ( y, z)] Lecture 6 صفحه 33
34 References. A course in fuzzy systems and control, L-X. Wang, 3. Tutorial on Fuzzy Logic,, Jan Jantzen, Technical University of Denmark, Technical report no 98-E E 868, 999 Lecture 6 صفحه 34
Computational Intelligence Lecture 13:Fuzzy Logic
Computational Intelligence Lecture 13:Fuzzy Logic Farzaneh Abdollahi Department of Electrical Engineering Amirkabir University of Technology Fall 2011 arzaneh Abdollahi Computational Intelligence Lecture
More informationComputational Intelligence Lecture 6:Fuzzy Rule Base and Fuzzy Inference Engine
Computational Intelligence Lecture 6:Fuzzy Rule Base and Fuzzy Inference Engine Farzaneh Abdollahi Department of Electrical Engineering Amirkabir University of Technology Fall 200 arzaneh Abdollahi Computational
More informationSo, we can say that fuzzy proposition is a statement p which acquires a fuzzy truth value T(p) ranges from(0 to1).
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
More informationHamidreza Rashidy Kanan. Electrical Engineering Department, Bu-Ali Sina University
Lecture 3 Fuzzy Systems and their Properties Hamidreza Rashidy Kanan Assistant Professor, Ph.D. Electrical Engineering Department, Bu-Ali Sina University h.rashidykanan@basu.ac.ir; kanan_hr@yahoo.com 2
More informationFuzzy Rules and Fuzzy Reasoning. Chapter 3, Neuro-Fuzzy and Soft Computing: Fuzzy Rules and Fuzzy Reasoning by Jang
Chapter 3, Neuro-Fuzzy and Soft Computing: Fuzzy Rules and Fuzzy Reasoning by Jang Outline Extension principle Fuzzy relations Fuzzy if-then rules Compositional rule of inference Fuzzy reasoning 2 Extension
More informationNatural Deduction is a method for deriving the conclusion of valid arguments expressed in the symbolism of propositional logic.
Natural Deduction is a method for deriving the conclusion of valid arguments expressed in the symbolism of propositional logic. The method consists of using sets of Rules of Inference (valid argument forms)
More informationFundamentals. 2.1 Fuzzy logic theory
Fundamentals 2 In this chapter we briefly review the fuzzy logic theory in order to focus the type of fuzzy-rule based systems with which we intend to compute intelligible models. Although all the concepts
More informationPROPOSITIONAL CALCULUS
PROPOSITIONAL CALCULUS A proposition is a complete declarative sentence that is either TRUE (truth value T or 1) or FALSE (truth value F or 0), but not both. These are not propositions! Connectives and
More informationRule-Based Fuzzy Model
In rule-based fuzzy systems, the relationships between variables are represented by means of fuzzy if then rules of the following general form: Ifantecedent proposition then consequent proposition The
More informationFuzzy Rules and Fuzzy Reasoning (chapter 3)
Fuzzy ules and Fuzzy easoning (chapter 3) Kai Goebel, Bill Cheetham GE Corporate esearch & Development goebel@cs.rpi.edu cheetham@cs.rpi.edu (adapted from slides by. Jang) Fuzzy easoning: The Big Picture
More informationToday s Lecture 2/25/10. Truth Tables Continued Introduction to Proofs (the implicational rules of inference)
Today s Lecture 2/25/10 Truth Tables Continued Introduction to Proofs (the implicational rules of inference) Announcements Homework: -- Ex 7.3 pg. 320 Part B (2-20 Even). --Read chapter 8.1 pgs. 345-361.
More informationPHI Propositional Logic Lecture 2. Truth Tables
PHI 103 - Propositional Logic Lecture 2 ruth ables ruth ables Part 1 - ruth unctions for Logical Operators ruth unction - the truth-value of any compound proposition determined solely by the truth-value
More informationFuzzy logic Fuzzyapproximate reasoning
Fuzzy logic Fuzzyapproximate reasoning 3.class 3/19/2009 1 Introduction uncertain processes dynamic engineering system models fundamental of the decision making in fuzzy based real systems is the approximate
More informationFuzzy Sets and Systems. Lecture 4 (Fuzzy Logic) Bu- Ali Sina University Computer Engineering Dep. Spring 2010
Fuzzy Sets and Systems Lecture 4 (Fuzzy Logic) Bu- Ali Sina University Computer Engineering Dep. Spring 2010 Outline Fuzzy Logic Classical logic- an overview Multi-valued logic Fuzzy logic Fuzzy proposition
More information2. The Logic of Compound Statements Summary. Aaron Tan August 2017
2. The Logic of Compound Statements Summary Aaron Tan 21 25 August 2017 1 2. The Logic of Compound Statements 2.1 Logical Form and Logical Equivalence Statements; Compound Statements; Statement Form (Propositional
More informationComputational Intelligence Winter Term 2017/18
Computational Intelligence Winter Term 2017/18 Prof. Dr. Günter Rudolph Lehrstuhl für Algorithm Engineering (LS 11) Fakultät für Informatik TU Dortmund Plan for Today Fuzzy relations Fuzzy logic Linguistic
More informationCOMP 182 Algorithmic Thinking. Proofs. Luay Nakhleh Computer Science Rice University
COMP 182 Algorithmic Thinking Proofs Luay Nakhleh Computer Science Rice University 1 Reading Material Chapter 1, Section 3, 6, 7, 8 Propositional Equivalences The compound propositions p and q are called
More informationICS141: Discrete Mathematics for Computer Science I
ICS141: Discrete Mathematics for Computer Science I Dept. Information & Computer Sci., Originals slides by Dr. Baek and Dr. Still, adapted by J. Stelovsky Based on slides Dr. M. P. Frank and Dr. J.L. Gross
More informationEECS 1028 M: Discrete Mathematics for Engineers
EECS 1028 M: Discrete Mathematics for Engineers Suprakash Datta Office: LAS 3043 Course page: http://www.eecs.yorku.ca/course/1028 Also on Moodle S. Datta (York Univ.) EECS 1028 W 18 1 / 12 Using the laws
More informationChapter 1, Logic and Proofs (3) 1.6. Rules of Inference
CSI 2350, Discrete Structures Chapter 1, Logic and Proofs (3) Young-Rae Cho Associate Professor Department of Computer Science Baylor University 1.6. Rules of Inference Basic Terminology Axiom: a statement
More informationFor a horseshoe statement, having the matching p (left side) gives you the q (right side) by itself. It does NOT work with matching q s.
7.1 The start of Proofs From now on the arguments we are working with are all VALID. There are 18 Rules of Inference (see the last 2 pages in Course Packet, or front of txt book). Each of these rules is
More informationPacket #1: Logic & Proofs. Applied Discrete Mathematics
Packet #1: Logic & Proofs Applied Discrete Mathematics Table of Contents Course Objectives Page 2 Propositional Calculus Information Pages 3-13 Course Objectives At the conclusion of this course, you should
More informationLecture 4 (Fuzzy Set Operations)
http://experty.4t.com Lecture 4 (Fuzzy Set Operation) We need a radically different kind of mathematic, the mathematic of fuzzy or cloudy quantitie which are not decribable in term of probability ditribution
More informationTowards Smooth Monotonicity in Fuzzy Inference System based on Gradual Generalized Modus Ponens
8th Conference of the European Society for Fuzzy Logic and Technology (EUSFLAT 2013) Towards Smooth Monotonicity in Fuzzy Inference System based on Gradual Generalized Modus Ponens Phuc-Nguyen Vo1 Marcin
More informationIt rains now. (true) The followings are not propositions.
Chapter 8 Fuzzy Logic Formal language is a language in which the syntax is precisely given and thus is different from informal language like English and French. The study of the formal languages is the
More informationWUCT121. Discrete Mathematics. Logic. Tutorial Exercises
WUCT11 Discrete Mathematics Logic Tutorial Exercises 1 Logic Predicate Logic 3 Proofs 4 Set Theory 5 Relations and Functions WUCT11 Logic Tutorial Exercises 1 Section 1: Logic Question1 For each of the
More informationProofs. Example of an axiom in this system: Given two distinct points, there is exactly one line that contains them.
Proofs A mathematical system consists of axioms, definitions and undefined terms. An axiom is assumed true. Definitions are used to create new concepts in terms of existing ones. Undefined terms are only
More informationIntroduction Logic Inference. Discrete Mathematics Andrei Bulatov
Introduction Logic Inference Discrete Mathematics Andrei Bulatov Discrete Mathematics - Logic Inference 6-2 Previous Lecture Laws of logic Expressions for implication, biconditional, exclusive or Valid
More informationUncertain Entailment and Modus Ponens in the Framework of Uncertain Logic
Journal of Uncertain Systems Vol.3, No.4, pp.243-251, 2009 Online at: www.jus.org.uk Uncertain Entailment and Modus Ponens in the Framework of Uncertain Logic Baoding Liu Uncertainty Theory Laboratory
More informationMACM 101 Discrete Mathematics I. Exercises on Propositional Logic. Due: Tuesday, September 29th (at the beginning of the class)
MACM 101 Discrete Mathematics I Exercises on Propositional Logic. Due: Tuesday, September 29th (at the beginning of the class) SOLUTIONS 1. Construct a truth table for the following compound proposition:
More informationDiscrete Structures of Computer Science Propositional Logic III Rules of Inference
Discrete Structures of Computer Science Propositional Logic III Rules of Inference Gazihan Alankuş (Based on original slides by Brahim Hnich) July 30, 2012 1 Previous Lecture 2 Summary of Laws of Logic
More informationReview The Conditional Logical symbols Argument forms. Logic 5: Material Implication and Argument Forms Jan. 28, 2014
Logic 5: Material Implication and Argument Forms Jan. 28, 2014 Overview I Review The Conditional Conditional statements Material implication Logical symbols Argument forms Disjunctive syllogism Disjunctive
More informationLecture 1: Introduction & Fuzzy Control I
Lecture 1: Introduction & Fuzzy Control I Jens Kober Robert Babuška Knowledge-Based Control Systems (SC42050) Cognitive Robotics 3mE, Delft University of Technology, The Netherlands 12-02-2018 Lecture
More informationCHAPTER 1 - LOGIC OF COMPOUND STATEMENTS
CHAPTER 1 - LOGIC OF COMPOUND STATEMENTS 1.1 - Logical Form and Logical Equivalence Definition. A statement or proposition is a sentence that is either true or false, but not both. ex. 1 + 2 = 3 IS a statement
More informationA Quick Lesson on Negation
A Quick Lesson on Negation Several of the argument forms we have looked at (modus tollens and disjunctive syllogism, for valid forms; denying the antecedent for invalid) involve a type of statement which
More informationHANDOUT AND SET THEORY. Ariyadi Wijaya
HANDOUT LOGIC AND SET THEORY Ariyadi Wijaya Mathematics Education Department Faculty of Mathematics and Natural Science Yogyakarta State University 2009 1 Mathematics Education Department Faculty of Mathematics
More informationTHE FORMAL TRIPLE I INFERENCE METHOD FOR LOGIC SYSTEM W UL
10 th February 013. Vol. 48 No.1 005-013 JATIT & LLS. All rights reserved. ISSN: 199-8645 www.jatit.org E-ISSN: 1817-3195 THE FORMAL TRIPLE I INFERENCE METHOD FOR LOGIC SYSTEM W UL 1 MINXIA LUO, NI SANG,
More information1.1 Statements and Compound Statements
Chapter 1 Propositional Logic 1.1 Statements and Compound Statements A statement or proposition is an assertion which is either true or false, though you may not know which. That is, a statement is something
More informationMathematical Logic Prof. Arindama Singh Department of Mathematics Indian Institute of Technology, Madras. Lecture - 15 Propositional Calculus (PC)
Mathematical Logic Prof. Arindama Singh Department of Mathematics Indian Institute of Technology, Madras Lecture - 15 Propositional Calculus (PC) So, now if you look back, you can see that there are three
More informationMaterial Implication and Entailment
510 Notre Dame Journal of Formal Logic Volume 29, Number 4, Fall 1988 Material Implication and Entailment CLARO R. CENIZA* The paradoxes of material implication have been called "paradoxes" of a sort because
More informationLogic. Definition [1] A logic is a formal language that comes with rules for deducing the truth of one proposition from the truth of another.
Math 0413 Appendix A.0 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. This type of logic is called propositional.
More informationTHE FORMAL TRIPLE I INFERENCE METHOD FOR LOGIC SYSTEM W UL
THE FORMAL TRIPLE I INFERENCE METHOD FOR LOGIC SYSTEM W UL 1 MINXIA LUO, 2 NI SANG, 3 KAI ZHANG 1 Department of Mathematics, China Jiliang University Hangzhou, China E-mail: minxialuo@163.com ABSTRACT
More informationCS 2336 Discrete Mathematics
CS 2336 Discrete Mathematics Lecture 3 Logic: Rules of Inference 1 Outline Mathematical Argument Rules of Inference 2 Argument In mathematics, an argument is a sequence of propositions (called premises)
More informationKybernetika. Niki Pfeifer; Gernot D. Kleiter Inference in conditional probability logic. Terms of use: Persistent URL:
Kybernetika Niki Pfeifer; Gernot D. Kleiter Inference in conditional probability logic Kybernetika, Vol. 42 (2006), No. 4, 391--404 Persistent URL: http://dml.cz/dmlcz/135723 Terms of use: Institute of
More informationThe proposition p is called the hypothesis or antecedent. The proposition q is called the conclusion or consequence.
The Conditional (IMPLIES) Operator The conditional operation is written p q. The proposition p is called the hypothesis or antecedent. The proposition q is called the conclusion or consequence. The Conditional
More informationFaster Adaptive Network Based Fuzzy Inference System
Faster Adaptive Network Based Fuzzy Inference System Submitted in partial fulfillment Of the requirements for The Degree of Doctor of Philosophy In Statistics At the University of Canterbury By Issarest
More informationSample Problems for all sections of CMSC250, Midterm 1 Fall 2014
Sample Problems for all sections of CMSC250, Midterm 1 Fall 2014 1. Translate each of the following English sentences into formal statements using the logical operators (,,,,, and ). You may also use mathematical
More informationCSE 20 DISCRETE MATH. Fall
CSE 20 DISCRETE MATH Fall 2017 http://cseweb.ucsd.edu/classes/fa17/cse20-ab/ Today's learning goals Distinguish between a theorem, an axiom, lemma, a corollary, and a conjecture. Recognize direct proofs
More informationRules Build Arguments Rules Building Arguments
Section 1.6 1 Section Summary Valid Arguments Inference Rules for Propositional Logic Using Rules of Inference to Build Arguments Rules of Inference for Quantified Statements Building Arguments for Quantified
More informationOUTLINE. Introduction History and basic concepts. Fuzzy sets and fuzzy logic. Fuzzy clustering. Fuzzy inference. Fuzzy systems. Application examples
OUTLINE Introduction History and basic concepts Fuzzy sets and fuzzy logic Fuzzy clustering Fuzzy inference Fuzzy systems Application examples "So far as the laws of mathematics refer to reality, they
More informationNeutrosophic Axiomatic System
5 eutrosophic Axiomatic System Florentin Smarandache 1 1 University of ew Mexico 705 Gurley Ave., Gallup, M 87301, USA smarand@unm.edu Abstract In this paper, we introduce for the first time the notions
More informationFormal Logic. Critical Thinking
ormal Logic Critical hinking Recap: ormal Logic If I win the lottery, then I am poor. I win the lottery. Hence, I am poor. his argument has the following abstract structure or form: If P then Q. P. Hence,
More informationIn this chapter, we specify a deductive apparatus for PL.
Handout 5 PL Derivations In this chapter, we specify a deductive apparatus for PL Definition deductive apparatus A deductive apparatus for PL is a set of rules of inference (or derivation rules) that determine
More informationn Empty Set:, or { }, subset of all sets n Cardinality: V = {a, e, i, o, u}, so V = 5 n Subset: A B, all elements in A are in B
Discrete Math Review Discrete Math Review (Rosen, Chapter 1.1 1.7, 5.5) TOPICS Sets and Functions Propositional and Predicate Logic Logical Operators and Truth Tables Logical Equivalences and Inference
More informationSection 1.2: Propositional Logic
Section 1.2: Propositional Logic January 17, 2017 Abstract Now we re going to use the tools of formal logic to reach logical conclusions ( prove theorems ) based on wffs formed by some given statements.
More informationMethods of Proof. 1.6 Rules of Inference. Argument and inference 12/8/2015. CSE2023 Discrete Computational Structures
Methods of Proof CSE0 Discrete Computational Structures Lecture 4 When is a mathematical argument correct? What methods can be used to construct mathematical arguments? Important in many computer science
More informationDISCRETE MATH: LECTURE 3
DISCRETE MATH: LECTURE 3 DR. DANIEL FREEMAN 1. Chapter 2.2 Conditional Statements If p and q are statement variables, the conditional of q by p is If p then q or p implies q and is denoted p q. It is false
More informationSection 1.3: Valid and Invalid Arguments
Section 1.3: Valid and Invalid Arguments Now we have developed the basic language of logic, we shall start to consider how logic can be used to determine whether or not a given argument is valid. In order
More informationIndex Terms Vague Logic, Linguistic Variable, Approximate Reasoning (AR), GMP and GMT
International Journal of Computer Science and Telecommunications [Volume 2, Issue 9, December 2011] 17 Vague Logic in Approximate Reasoning ISSN 2047-3338 Supriya Raheja, Reena Dadhich and Smita Rajpal
More informationPacket #2: Set Theory & Predicate Calculus. Applied Discrete Mathematics
CSC 224/226 Notes Packet #2: Set Theory & Predicate Calculus Barnes Packet #2: Set Theory & Predicate Calculus Applied Discrete Mathematics Table of Contents Full Adder Information Page 1 Predicate Calculus
More informationClassical Set Theory. Outline. Classical Set Theory. 4. Linguistic model, approximate reasoning. 1. Fuzzy sets and set-theoretic operations.
Knowledge-Based Control Systems (SC48) Lecture 2: Fuzzy Sets and Systems lfredo Núñez Section of Railway Engineering CiTG, Delft University of Tecnology Te Neterlands Robert Babuška Delft Center for Systems
More information10/13/15. Proofs: what and why. Proposi<onal Logic Proofs. 1 st Proof Method: Truth Table. A sequence of logical arguments such that:
Proofs: what and why Rules of Inference (Rosen, Section 1.6) TOPICS Logic Proofs ² via Truth Tables ² via Algebraic Simplification ² via Inference Rules A sequence of logical arguments such that: each
More informationCSE 20 DISCRETE MATH. Winter
CSE 20 DISCRETE MATH Winter 2017 http://cseweb.ucsd.edu/classes/wi17/cse20-ab/ Today's learning goals Distinguish between a theorem, an axiom, lemma, a corollary, and a conjecture. Recognize direct proofs
More informationThe Logic of Compound Statements cont.
The Logic of Compound Statements cont. CSE 215, Computer Science 1, Fall 2011 Stony Brook University http://www.cs.stonybrook.edu/~cse215 Refresh from last time: Logical Equivalences Commutativity of :
More informationValid Reasoning. Alice E. Fischer. CSCI 1166 Discrete Mathematics for Computing February, Outline Truth and Validity Valid Reasoning
Alice E. Fischer CSCI 1166 Discrete Mathematics for Computing February, 2018 Alice E. Fischer Reasoning... 1/23 1 Truth is not the same as Validity 2 Alice E. Fischer Reasoning... 2/23 Truth is not the
More information15414/614 Optional Lecture 1: Propositional Logic
15414/614 Optional Lecture 1: Propositional Logic Qinsi Wang Logic is the study of information encoded in the form of logical sentences. We use the language of Logic to state observations, to define concepts,
More informationLogical Form 5 Famous Valid Forms. Today s Lecture 1/26/10
Logical Form 5 Famous Valid Forms Today s Lecture 1/26/10 Announcements Homework: --Read Chapter 7 pp. 277-298 (doing the problems in parts A, B, and C pp. 298-300 are recommended but not required at this
More informationLast Time. Inference Rules
Last Time When program S executes it switches to a different state We need to express assertions on the states of the program S before and after its execution We can do it using a Hoare triple written
More informationAdvanced Topics in LP and FP
Lecture 1: Prolog and Summary of this lecture 1 Introduction to Prolog 2 3 Truth value evaluation 4 Prolog Logic programming language Introduction to Prolog Introduced in the 1970s Program = collection
More informationPropositional Calculus - Hilbert system H Moonzoo Kim CS Division of EECS Dept. KAIST
Propositional Calculus - Hilbert system H Moonzoo Kim CS Division of EECS Dept. KAIST moonzoo@cs.kaist.ac.kr http://pswlab.kaist.ac.kr/courses/cs402-07 1 Review Goal of logic To check whether given a formula
More informationA. Propositional Logic
CmSc 175 Discrete Mathematics A. Propositional Logic 1. Statements (Propositions ): Statements are sentences that claim certain things. Can be either true or false, but not both. Propositional logic deals
More informationPropositional Logic Arguments (5A) Young W. Lim 11/30/16
Propositional Logic (5A) Young W. Lim Copyright (c) 2016 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version
More informationDISCRETE MATH: LECTURE Chapter 3.3 Statements with Multiple Quantifiers If you want to establish the truth of a statement of the form
DISCRETE MATH: LECTURE 5 DR. DANIEL FREEMAN 1. Chapter 3.3 Statements with Multiple Quantifiers If you want to establish the truth of a statement of the form x D, y E such that P (x, y) your challenge
More informationFuzzy Reasoning with a Rete-OO Rule Engine
Fuzzy Reasoning with a Rete-OO Rule Engine University of Applied Sciences Münster, Germany 1 DEIS, Facolta di Ingegneria, Universita di Bologna, Italy 2 Nikolaus Wulff 1 (Speaker) Davide Sottara 2 Why
More informationPredicate Logic. Andreas Klappenecker
Predicate Logic Andreas Klappenecker Predicates A function P from a set D to the set Prop of propositions is called a predicate. The set D is called the domain of P. Example Let D=Z be the set of integers.
More informationDiscrete Structures for Computer Science
Discrete Structures for Computer Science William Garrison bill@cs.pitt.edu 6311 Sennott Square Lecture #6: Rules of Inference Based on materials developed by Dr. Adam Lee Today s topics n Rules of inference
More information1. Brief History of Intelligent Control Systems Design Technology
Acknowledgments We would like to express our appreciation to Professor S.V. Ulyanov for his continuous help, value corrections and comments to the organization of this paper. We also wish to acknowledge
More informationA SIMPLE AXIOMATIZATION OF LUKASIEWICZ S MODAL LOGIC
Bulletin of the Section of Logic Volume 41:3/4 (2012), pp. 149 153 Zdzis law Dywan A SIMPLE AXIOMATIZATION OF LUKASIEWICZ S MODAL LOGIC Abstract We will propose a new axiomatization of four-valued Lukasiewicz
More informationABDUCTIVE reasoning is an explanatory process in
Selecting Implications in Fuzzy bductive Problems drien Revault d llonnes Herman kdag ernadette ouchon-meunier bstract bductive reasoning is an explanatory process in which potential causes of an observation
More informationMath.3336: Discrete Mathematics. Nested Quantifiers/Rules of Inference
Math.3336: Discrete Mathematics Nested Quantifiers/Rules of Inference Instructor: Dr. Blerina Xhabli Department of Mathematics, University of Houston https://www.math.uh.edu/ blerina Email: blerina@math.uh.edu
More informationPropositional Logic Arguments (5A) Young W. Lim 2/23/17
Propositional Logic (5A) Young W. Lim Copyright (c) 2016 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version
More informationCSE 20: Discrete Mathematics
Spring 2018 Summary Last time: Today: Logical connectives: not, and, or, implies Using Turth Tables to define logical connectives Logical equivalences, tautologies Some applications Proofs in propositional
More informationCSE 20 DISCRETE MATH SPRING
CSE 20 DISCRETE MATH SPRING 2016 http://cseweb.ucsd.edu/classes/sp16/cse20-ac/ Today's learning goals Evaluate which proof technique(s) is appropriate for a given proposition Direct proof Proofs by contraposition
More informationCSE 20 DISCRETE MATH WINTER
CSE 20 DISCRETE MATH WINTER 2016 http://cseweb.ucsd.edu/classes/wi16/cse20-ab/ Today's learning goals Evaluate which proof technique(s) is appropriate for a given proposition Direct proof Proofs by contraposition
More information5. And. 5.1 The conjunction
5. And 5.1 The conjunction To make our logical language more easy and intuitive to use, we can now add to it elements that make it able to express the equivalents of other sentences from a natural language
More information10/5/2012. Logic? What is logic? Propositional Logic. Propositional Logic (Rosen, Chapter ) Logic is a truth-preserving system of inference
Logic? Propositional Logic (Rosen, Chapter 1.1 1.3) TOPICS Propositional Logic Truth Tables Implication Logical Proofs 10/1/12 CS160 Fall Semester 2012 2 What is logic? Logic is a truth-preserving system
More informationPropositional Logic. Argument Forms. Ioan Despi. University of New England. July 19, 2013
Propositional Logic Argument Forms Ioan Despi despi@turing.une.edu.au University of New England July 19, 2013 Outline Ioan Despi Discrete Mathematics 2 of 1 Order of Precedence Ioan Despi Discrete Mathematics
More informationBoolean Algebra and Proof. Notes. Proving Propositions. Propositional Equivalences. Notes. Notes. Notes. Notes. March 5, 2012
March 5, 2012 Webwork Homework. The handout on Logic is Chapter 4 from Mary Attenborough s book Mathematics for Electrical Engineering and Computing. Proving Propositions We combine basic propositions
More informationFuzzy Rules and Fuzzy Reasoning (chapter 3)
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
More informationAnalyzing Arguments with Truth Tables
Analyzing Arguments with Truth Tables MATH 100 Survey of Mathematical Ideas J. Robert Buchanan Department of Mathematics Fall 2014 Introduction Euler diagrams are useful for checking the validity of simple
More informationReview. Propositions, propositional operators, truth tables. Logical Equivalences. Tautologies & contradictions
Review Propositions, propositional operators, truth tables Logical Equivalences. Tautologies & contradictions Some common logical equivalences Predicates & quantifiers Some logical equivalences involving
More informationLogic, Sets, and Proofs
Logic, Sets, and Proofs David A. Cox and Catherine C. McGeoch Amherst College 1 Logic Logical Operators. A logical statement is a mathematical statement that can be assigned a value either true or false.
More informationFirst-Degree Entailment
March 5, 2013 Relevance Logics Relevance logics are non-classical logics that try to avoid the paradoxes of material and strict implication: p (q p) p (p q) (p q) (q r) (p p) q p (q q) p (q q) Counterintuitive?
More informationCSCE 222 Discrete Structures for Computing. Review for Exam 1. Dr. Hyunyoung Lee !!!
CSCE 222 Discrete Structures for Computing Review for Exam 1 Dr. Hyunyoung Lee 1 Topics Propositional Logic (Sections 1.1, 1.2 and 1.3) Predicate Logic (Sections 1.4 and 1.5) Rules of Inferences and Proofs
More informationPropositional Logic Arguments (5A) Young W. Lim 10/11/16
Propositional Logic (5A) Young W. Lim Copyright (c) 2016 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version
More informationFuzzy Expert Systems Lecture 3 (Fuzzy Logic)
http://expertsys.4t.com Fuzzy Expert Systems Lecture 3 (Fuzzy Logic) As far as the laws of mathematics refer to reality, they are not certain, and so far as they are certain, they do not refer to reality.
More information5. And. 5.1 The conjunction
5. And 5.1 The conjunction To make our logical language more easy and intuitive to use, we can now add to it elements that make it able to express the equivalents of other sentences from a natural language
More informationLecture 2. Logic Compound Statements Conditional Statements Valid & Invalid Arguments Digital Logic Circuits. Reading (Epp s textbook)
Lecture 2 Logic Compound Statements Conditional Statements Valid & Invalid Arguments Digital Logic Circuits Reading (Epp s textbook) 2.1-2.4 1 Logic Logic is a system based on statements. A statement (or
More informationWarm-Up Problem. Write a Resolution Proof for. Res 1/32
Warm-Up Problem Write a Resolution Proof for Res 1/32 A second Rule Sometimes throughout we need to also make simplifications: You can do this in line without explicitly mentioning it (just pretend you
More informationME 534. Mechanical Engineering University of Gaziantep. Dr. A. Tolga Bozdana Assistant Professor
ME 534 Intelligent Manufacturing Systems Chp 4 Fuzzy Logic Mechanical Engineering University of Gaziantep Dr. A. Tolga Bozdana Assistant Professor Motivation and Definition Fuzzy Logic was initiated by
More information