Fuzzy Rules and Fuzzy Reasoning (chapter 3)
|
|
- Gervase Chambers
- 6 years ago
- Views:
Transcription
1 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
2 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 = 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 = ={ = } ={a b} Calculate: is relevant to a = ={ } ={a b} = (, ) =, m a , 0. 0., , 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
3 9/4/00 Linguistic Values (Terms) Operations on Linguistic Values Concentration: Dilation: Contrast Intensification: CON = DIL = 0.5,. INT = 0 05 ( ), 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
4 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
5 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
6 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
Fuzzy 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 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 informationFuzzy Rules & Fuzzy Reasoning
Sistem Cerdas : PTK Pasca Sarjana - UNY Fuzzy Rules & Fuzzy Reasoning Pengampu: Fatchul Arifin Referensi: Jyh-Shing Roger Jang et al., Neuro-Fuzzy and Soft Computing: A Computational Approach to Learning
More informationFuzzy Controller. Fuzzy Inference System. Basic Components of Fuzzy Inference System. Rule based system: Contains a set of fuzzy rules
Fuzz Controller Fuzz Inference Sstem Basic Components of Fuzz Inference Sstem Rule based sstem: Contains a set of fuzz rules Data base dictionar: Defines the membership functions used in the rules base
More informationOutline. Introduction, or what is fuzzy thinking? Fuzzy sets Linguistic variables and hedges Operations of fuzzy sets Fuzzy rules Summary.
Fuzzy Logic Part ndrew Kusiak Intelligent Systems Laboratory 239 Seamans Center The University of Iowa Iowa City, Iowa 52242-527 andrew-kusiak@uiowa.edu http://www.icaen.uiowa.edu/~ankusiak Tel: 39-335
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 Expert Systems Lecture 6 (Fuzzy Logic )
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 صفحه Summary
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 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 informationInstructor: Shihua Li School of Automation Southeast university
Course Introduction to Intelligent Control Instructor: Shihua Li School of utomation Southeast university Chap. 2 Fundamentals of Fuzzy Logic Systems(P. 57) 2. Introduction Fuzzy logic -------- a systematic,
More informationWhat is Fuzzy Logic? Fuzzy logic is a tool for embedding human knowledge (experience, expertise, heuristics) Fuzzy Logic
Fuzz Logic Andrew Kusiak 239 Seamans Center Iowa Cit, IA 52242 527 andrew-kusiak@uiowa.edu http://www.icaen.uiowa.edu/~ankusiak (Based on the material provided b Professor V. Kecman) What is Fuzz Logic?
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 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 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 informationTwo conventions for coordinate systems. Left-Hand vs Right-Hand. x z. Which is which?
walters@buffalo.edu CSE 480/580 Lecture 2 Slide 3-D Transformations 3-D space Two conventions for coordinate sstems Left-Hand vs Right-Hand (Thumb is the ais, inde is the ais) Which is which? Most graphics
More informationPropositional Logic: Review
Propositional Logic: Review Propositional logic Logical constants: true, false Propositional symbols: P, Q, S,... (atomic sentences) Wrapping parentheses: ( ) Sentences are combined by connectives:...and...or
More informationMATRIX TRANSFORMATIONS
CHAPTER 5. MATRIX TRANSFORMATIONS INSTITIÚID TEICNEOLAÍOCHTA CHEATHARLACH INSTITUTE OF TECHNOLOGY CARLOW MATRIX TRANSFORMATIONS Matri Transformations Definition Let A and B be sets. A function f : A B
More informationFuzzy control systems. Miklós Gerzson
Fuzzy control systems Miklós Gerzson 2016.11.24. 1 Introduction The notion of fuzziness: type of car the determination is unambiguous speed of car can be measured, but the judgment is not unambiguous:
More informationUnit 12 Study Notes 1 Systems of Equations
You should learn to: Unit Stud Notes Sstems of Equations. Solve sstems of equations b substitution.. Solve sstems of equations b graphing (calculator). 3. Solve sstems of equations b elimination. 4. Solve
More informationLogic. Introduction to Artificial Intelligence CS/ECE 348 Lecture 11 September 27, 2001
Logic Introduction to Artificial Intelligence CS/ECE 348 Lecture 11 September 27, 2001 Last Lecture Games Cont. α-β pruning Outline Games with chance, e.g. Backgammon Logical Agents and thewumpus World
More informationLinear and Angular Velocities 2/4. Instructor: Jacob Rosen Advanced Robotic - MAE 263D - Department of Mechanical & Aerospace Engineering - UCLA
Linear and ngular elocities 2/4 Instructor: Jacob osen dvanced obotic - ME 263D - Department of Mechanical & erospace Engineering - UL Jacobian Matri - alculation Methods Differentiation the Forward Kinematics
More informationAdditional Material On Recursive Sequences
Penn State Altoona MATH 141 Additional Material On Recursive Sequences 1. Graphical Analsis Cobweb Diagrams Consider a generic recursive sequence { an+1 = f(a n ), n = 1,, 3,..., = Given initial value.
More informationAE/ME 339. K. M. Isaac Professor of Aerospace Engineering. December 21, 2001 topic13_grid_generation 1
AE/ME 339 Professor of Aerospace Engineering December 21, 2001 topic13_grid_generation 1 The basic idea behind grid generation is the creation of the transformation laws between the phsical space and the
More informationNonlinear Function Approximation Using Fuzzy Functional SIRMs Inference Model
Nonlinear Function Approximation Using Fuzz Functional SIRMs Inference Model HIROSATO SEKI Osaka Institute of Technolog Department of Technolog Management 5-6-, Omia, Asahi-ku, Osaka JAPAN h seki@ieee.org
More informationThe approximation of piecewise linear membership functions and Łukasiewicz operators
Fuzz Sets and Sstems 54 25 275 286 www.elsevier.com/locate/fss The approimation of piecewise linear membership functions and Łukasiewicz operators József Dombi, Zsolt Gera Universit of Szeged, Institute
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 informationThe Sigmoidal Approximation of Łukasiewicz Operators
The Sigmoidal Approimation of Łukasiewicz Operators József Dombi, Zsolt Gera Universit of Szeged, Institute of Informatics e-mail: {dombi gera}@inf.u-szeged.hu Abstract: In this paper we propose an approimation
More informationHandling Uncertainty using FUZZY LOGIC
Handling Uncertainty using FUZZY LOGIC Fuzzy Set Theory Conventional (Boolean) Set Theory: 38 C 40.1 C 41.4 C 38.7 C 39.3 C 37.2 C 42 C Strong Fever 38 C Fuzzy Set Theory: 38.7 C 40.1 C 41.4 C More-or-Less
More informationComputational 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 informationChapter 3: Propositional Calculus: Deductive Systems. September 19, 2008
Chapter 3: Propositional Calculus: Deductive Systems September 19, 2008 Outline 1 3.1 Deductive (Proof) System 2 3.2 Gentzen System G 3 3.3 Hilbert System H 4 3.4 Soundness and Completeness; Consistency
More information14.1 Systems of Linear Equations in Two Variables
86 Chapter 1 Sstems of Equations and Matrices 1.1 Sstems of Linear Equations in Two Variables Use the method of substitution to solve sstems of equations in two variables. Use the method of elimination
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 informationSection 2.2 Set Operations. Propositional calculus and set theory are both instances of an algebraic system called a. Boolean Algebra.
Section 2.2 Set Operations Propositional calculus and set theory are both instances of an algebraic system called a Boolean Algebra. The operators in set theory are defined in terms of the corresponding
More information8. BOOLEAN ALGEBRAS x x
8. BOOLEAN ALGEBRAS 8.1. Definition of a Boolean Algebra There are man sstems of interest to computing scientists that have a common underling structure. It makes sense to describe such a mathematical
More informationVectors and the Geometry of Space
Chapter 12 Vectors and the Geometr of Space Comments. What does multivariable mean in the name Multivariable Calculus? It means we stud functions that involve more than one variable in either the input
More informationCHAPTER 2: Partial Derivatives. 2.2 Increments and Differential
CHAPTER : Partial Derivatives.1 Definition of a Partial Derivative. Increments and Differential.3 Chain Rules.4 Local Etrema.5 Absolute Etrema 1 Chapter : Partial Derivatives.1 Definition of a Partial
More informationcse371/mat371 LOGIC Professor Anita Wasilewska Fall 2018
cse371/mat371 LOGIC Professor Anita Wasilewska Fall 2018 Chapter 7 Introduction to Intuitionistic and Modal Logics CHAPTER 7 SLIDES Slides Set 1 Chapter 7 Introduction to Intuitionistic and Modal Logics
More informationAn Information Theory For Preferences
An Information Theor For Preferences Ali E. Abbas Department of Management Science and Engineering, Stanford Universit, Stanford, Ca, 94305 Abstract. Recent literature in the last Maimum Entrop workshop
More informationFinancial Informatics XI: Fuzzy Rule-based Systems
Financial Informatics XI: Fuzzy Rule-based Systems Khurshid Ahmad, Professor of Computer Science, Department of Computer Science Trinity College, Dublin-2, IRELAND November 19 th, 28. https://www.cs.tcd.ie/khurshid.ahmad/teaching.html
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 information9.2. Cartesian Components of Vectors. Introduction. Prerequisites. Learning Outcomes
Cartesian Components of Vectors 9.2 Introduction It is useful to be able to describe vectors with reference to specific coordinate sstems, such as the Cartesian coordinate sstem. So, in this Section, we
More informationChapter Adequacy of Solutions
Chapter 04.09 dequac of Solutions fter reading this chapter, ou should be able to: 1. know the difference between ill-conditioned and well-conditioned sstems of equations,. define the norm of a matri,
More informationLogical Agents. September 14, 2004
Logical Agents September 14, 2004 The aim of AI is to develop intelligent agents that can reason about actions and their effects and about the environment, create plans to achieve a goal, execute the plans,
More informationKnowledge-based systems
CS 750 Foundations of I Lecture 6 Knowledge-based systems Milos Hauskrecht milos@cs.pitt.edu 539 Sennott Square dministration announcements Midterm: Thursda October 6, 07 In-class Closed book What does
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 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 information2D Wavelets. Gloria Menegaz 1
D Wavelets Gloria Menegaz Topics Basic issues Separable spaces and bases Separable wavelet bases D DWT Fast D DWT Lifting steps scheme JPEG000 Wavelet packets Advanced concepts Overcomplete bases Discrete
More informationMAT389 Fall 2016, Problem Set 2
MAT389 Fall 2016, Problem Set 2 Circles in the Riemann sphere Recall that the Riemann sphere is defined as the set Let P be the plane defined b Σ = { (a, b, c) R 3 a 2 + b 2 + c 2 = 1 } P = { (a, b, c)
More informationFoundations of Databases
Foundations of Databases (Slides adapted from Thomas Eiter, Leonid Libkin and Werner Nutt) Foundations of Databases 1 Quer optimization: finding a good wa to evaluate a quer Queries are declarative, and
More informationSystems of Linear Equations: Solving by Graphing
8.1 Sstems of Linear Equations: Solving b Graphing 8.1 OBJECTIVE 1. Find the solution(s) for a set of linear equations b graphing NOTE There is no other ordered pair that satisfies both equations. From
More informationUncertainty and Rules
Uncertainty and Rules We have already seen that expert systems can operate within the realm of uncertainty. There are several sources of uncertainty in rules: Uncertainty related to individual rules Uncertainty
More informationEEE 8005 Student Directed Learning (SDL) Industrial Automation Fuzzy Logic
EEE 8005 Student Directed Learning (SDL) Industrial utomation Fuzzy Logic Desire location z 0 Rot ( y, φ ) Nail cos( φ) 0 = sin( φ) 0 0 0 0 sin( φ) 0 cos( φ) 0 0 0 0 z 0 y n (0,a,0) y 0 y 0 z n End effector
More informationSimlification of Switching Functions
Simlification of Switching unctions ( ) = ( 789 5) Quine-Mc luskey Original nonminimized oolean function m i m i m n m i [] m m m m m 4 m 5 m 6 m 7 m 8 m 9 m m m m m 4 m 5 m m m 7 m 8 m 9 m m 5 The number
More informationArtificial Intelligence. Propositional logic
Artificial Intelligence Propositional logic Propositional Logic: Syntax Syntax of propositional logic defines allowable sentences Atomic sentences consists of a single proposition symbol Each symbol stands
More information12.1 Systems of Linear equations: Substitution and Elimination
. Sstems of Linear equations: Substitution and Elimination Sstems of two linear equations in two variables A sstem of equations is a collection of two or more equations. A solution of a sstem in two variables
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 informationDecision tables and decision spaces
Abstract Decision tables and decision spaces Z. Pawlak 1 Abstract. In this paper an Euclidean space, called a decision space is associated with ever decision table. This can be viewed as a generalization
More informationThree Profound Theorems about Mathematical Logic
Power & Limits of Logic Three Profound Theorems about Mathematical Logic Gödel's Completeness Theorem Thm 1, good news: only need to know* a few axioms & rules, to prove all validities. *Theoretically
More informationVector Calculus Review
Course Instructor Dr. Ramond C. Rumpf Office: A-337 Phone: (915) 747-6958 E-Mail: rcrumpf@utep.edu Vector Calculus Review EE3321 Electromagnetic Field Theor Outline Mathematical Preliminaries Phasors,
More informationModule 3, Section 4 Analytic Geometry II
Principles of Mathematics 11 Section, Introduction 01 Introduction, Section Analtic Geometr II As the lesson titles show, this section etends what ou have learned about Analtic Geometr to several related
More information4.7. Newton s Method. Procedure for Newton s Method HISTORICAL BIOGRAPHY
4. Newton s Method 99 4. Newton s Method HISTORICAL BIOGRAPHY Niels Henrik Abel (18 189) One of the basic problems of mathematics is solving equations. Using the quadratic root formula, we know how to
More informationUncertain Systems are Universal Approximators
Uncertain Systems are Universal Approximators Zixiong Peng 1 and Xiaowei Chen 2 1 School of Applied Mathematics, Central University of Finance and Economics, Beijing 100081, China 2 epartment of Risk Management
More information7. Logical Agents. COMP9414/ 9814/ 3411: Artificial Intelligence. Outline. Knowledge base. Models and Planning. Russell & Norvig, Chapter 7.
COMP944/984/34 6s Logic COMP944/ 984/ 34: rtificial Intelligence 7. Logical gents Outline Knowledge-based agents Wumpus world Russell & Norvig, Chapter 7. Logic in general models and entailment Propositional
More informationIntro. ANN & Fuzzy Systems. Lec 34 Fuzzy Logic Control (II)
Lec 34 Fuzz Logic Control (II) Outline Control Rule Base Fuzz Inference Defuzzification FLC Design Procedures (C) 2001 b Yu Hen Hu 2 General form of rule: IF Control Rule Base x 1 is A 1 AND AND x M is
More information03 Propositional Logic II
Martin Henz February 12, 2014 Generated on Wednesday 12 th February, 2014, 09:49 1 Review: Syntax and Semantics of Propositional Logic 2 3 Propositional Atoms and Propositions Semantics of Formulas Validity,
More informationFuzzy Logic. An introduction. Universitat Politécnica de Catalunya. Departament de Teoria del Senyal i Comunicacions.
Universitat Politécnica de Catalunya Departament de Teoria del Senyal i Comunicacions Fuzzy Logic An introduction Prepared by Temko Andrey 2 Outline History and sphere of applications Basics. Fuzzy sets
More informationis implemented by a fuzzy relation R i and is defined as
FS VI: Fuzzy reasoning schemes R 1 : ifx is A 1 and y is B 1 then z is C 1 R 2 : ifx is A 2 and y is B 2 then z is C 2... R n : ifx is A n and y is B n then z is C n x is x 0 and y is ȳ 0 z is C The i-th
More informationChapter 1 Similarity Based Reasoning Fuzzy Systems and Universal Approximation
Chapter 1 Similarity Based Reasoning Fuzzy Systems and Universal Approximation Sayantan Mandal and Balasubramaniam Jayaram Abstract In this work, we show that fuzzy inference systems based on Similarity
More informationRELATIONS AND FUNCTIONS through
RELATIONS AND FUNCTIONS 11.1.2 through 11.1. Relations and Functions establish a correspondence between the input values (usuall ) and the output values (usuall ) according to the particular relation or
More informationInclusion Relationship of Uncertain Sets
Yao Journal of Uncertainty Analysis Applications (2015) 3:13 DOI 10.1186/s40467-015-0037-5 RESEARCH Open Access Inclusion Relationship of Uncertain Sets Kai Yao Correspondence: yaokai@ucas.ac.cn School
More informationOne Solution Two Solutions Three Solutions Four Solutions. Since both equations equal y we can set them equal Combine like terms Factor Solve for x
Algebra Notes Quadratic Systems Name: Block: Date: Last class we discussed linear systems. The only possibilities we had we 1 solution, no solution or infinite solutions. With quadratic systems we have
More informationSome linear transformations on R 2 Math 130 Linear Algebra D Joyce, Fall 2013
Some linear transformations on R 2 Math 3 Linear Algebra D Joce, Fall 23 Let s look at some some linear transformations on the plane R 2. We ll look at several kinds of operators on R 2 including reflections,
More informationFunctions 3: Compositions of Functions
Functions : Compositions of Functions 7 Functions : Compositions of Functions Model : Word Machines SIGN SIGNS ONK KNO COW COWS RT TR HI HIS KYK KYK Construct Your Understanding Questions (to do in class).
More informationHadi s Method and It s Advantage in Ranking Fuzzy Numbers
ustralian Journal of Basic and pplied Sciences, 4(1): 46-467, 1 ISSN 1991-8178 Hadi s Method and It s dvantage in anking Fuzz Numbers S.H. Nasseri, M. Sohrabi Department of Mathematical Sciences, Mazandaran
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 informationVenn Diagrams for Boolean Algebra
Venn Diagrams for oolean lgebra Renata de Freitas IME UFF Petrucio Viana II Workshop on Logic and Semantics Ilha Grande, ugust 26-30, 2013 This is a post-workshop version. We thank the participants of
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 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 informationLogic, Human Logic, and Propositional Logic. Human Logic. Fragments of Information. Conclusions. Foundations of Semantics LING 130 James Pustejovsky
Logic, Human Logic, and Propositional Logic Foundations of Semantics LING 3 James Pustejovsky Human Logic Thanks to Michael Genesereth of Stanford for use of some slides Fragments of Information Conclusions
More informationAPPENDIX D Rotation and the General Second-Degree Equation
APPENDIX D Rotation and the General Second-Degree Equation Rotation of Aes Invariants Under Rotation After rotation of the - and -aes counterclockwise through an angle, the rotated aes are denoted as the
More informationINF5390 Kunstig intelligens. Logical Agents. Roar Fjellheim
INF5390 Kunstig intelligens Logical Agents Roar Fjellheim Outline Knowledge-based agents The Wumpus world Knowledge representation Logical reasoning Propositional logic Wumpus agent Summary AIMA Chapter
More informationNatural Deduction. Formal Methods in Verification of Computer Systems Jeremy Johnson
Natural Deduction Formal Methods in Verification of Computer Systems Jeremy Johnson Outline 1. An example 1. Validity by truth table 2. Validity by proof 2. What s a proof 1. Proof checker 3. Rules of
More informationGreen s Theorem Jeremy Orloff
Green s Theorem Jerem Orloff Line integrals and Green s theorem. Vector Fields Vector notation. In 8.4 we will mostl use the notation (v) = (a, b) for vectors. The other common notation (v) = ai + bj runs
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 informationHandout for Adequacy of Solutions Chapter SET ONE The solution to Make a small change in the right hand side vector of the equations
Handout for dequac of Solutions Chapter 04.07 SET ONE The solution to 7.999 4 3.999 Make a small change in the right hand side vector of the equations 7.998 4.00 3.999 4.000 3.999 Make a small change in
More informationThe Importance of Being Formal. Martin Henz. February 5, Propositional Logic
The Importance of Being Formal Martin Henz February 5, 2014 Propositional Logic 1 Motivation In traditional logic, terms represent sets, and therefore, propositions are limited to stating facts on sets
More informationCONTINUOUS SPATIAL DATA ANALYSIS
CONTINUOUS SPATIAL DATA ANALSIS 1. Overview of Spatial Stochastic Processes The ke difference between continuous spatial data and point patterns is that there is now assumed to be a meaningful value, s
More informationSOLVING QUADRATICS. Copyright - Kramzil Pty Ltd trading as Academic Teacher Resources
SOLVING QUADRATICS Copyright - Kramzil Pty Ltd trading as Academic Teacher Resources SOLVING QUADRATICS General Form: y a b c Where a, b and c are constants To solve a quadratic equation, the equation
More informationFuzzy Systems, Modeling and Identification
Fuzz Sstems, Modeling and Identification Robert Babuška Delft Universit of Technolog, Department of Electrical Engineering Control Laborator, Mekelweg 4, P.O. Bo 53, 26 GA Delft, The Netherlands tel: +3
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 informationKnowledge base (KB) = set of sentences in a formal language Declarative approach to building an agent (or other system):
Logic Knowledge-based agents Inference engine Knowledge base Domain-independent algorithms Domain-specific content Knowledge base (KB) = set of sentences in a formal language Declarative approach to building
More informationOutline. On Premise Evaluation On Conclusion Entailment. 1 Imperfection : Why and What. 2 Imperfection : How. 3 Conclusions
Outline 1 Imperfection : Why and What 2 Imperfection : How On Premise Evaluation On Conclusion Entailment 3 Conclusions Outline 1 Imperfection : Why and What 2 Imperfection : How On Premise Evaluation
More informationSemantics for Propositional Logic
Semantics for Propositional Logic An interpretation (also truth-assignment, valuation) of a set of propositional formulas S is a function that assigns elements of {f,t} to the propositional variables in
More informationIn applications, we encounter many constrained optimization problems. Examples Basis pursuit: exact sparse recovery problem
1 Conve Analsis Main references: Vandenberghe UCLA): EECS236C - Optimiation methods for large scale sstems, http://www.seas.ucla.edu/ vandenbe/ee236c.html Parikh and Bod, Proimal algorithms, slides and
More informationSection 3.1. ; X = (0, 1]. (i) f : R R R, f (x, y) = x y
Paul J. Bruillard MATH 0.970 Problem Set 6 An Introduction to Abstract Mathematics R. Bond and W. Keane Section 3.1: 3b,c,e,i, 4bd, 6, 9, 15, 16, 18c,e, 19a, 0, 1b Section 3.: 1f,i, e, 6, 1e,f,h, 13e,
More informationCVAR REDUCED FUZZY VARIABLES AND THEIR SECOND ORDER MOMENTS
Iranian Journal of Fuzzy Systems Vol., No. 5, (05 pp. 45-75 45 CVAR REDUCED FUZZY VARIABLES AND THEIR SECOND ORDER MOMENTS X. J. BAI AND Y. K. LIU Abstract. Based on credibilistic value-at-risk (CVaR of
More informationFraming human inference by coherence based probability logic
Framing human inference by coherence based probability logic Pfeifer, N., & Kleiter, G. D. University of Salzburg (Austria) p. 1 Why coherence based? Degrees of belief & subjective probabilities versus
More informationWhere are we? Operations on fuzzy sets (cont.) Fuzzy Logic. Motivation. Crisp and fuzzy sets. Examples
Operations on fuzzy sets (cont.) G. J. Klir, B. Yuan, Fuzzy Sets and Fuzzy Logic: Theory and Applications, Prentice-Hall, chapters -5 Where are we? Motivation Crisp and fuzzy sets alpha-cuts, support,
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 informationInference in Propositional Logic
Inference in Propositional Logic Deepak Kumar November 2017 Propositional Logic A language for symbolic reasoning Proposition a statement that is either True or False. E.g. Bryn Mawr College is located
More information