Fuzzy Implication Rules. Adnan Yazıcı Dept. of Computer Engineering, Middle East Technical University Ankara/Turkey


 Kellie Houston
 2 years ago
 Views:
Transcription
1 Fuzzy Implication Rules Adnan Yazıcı Dept. of Computer Engineering, Middle East Technical University Ankara/Turkey
2 Fuzzy IfThen Rules Remember: The difference between the semantics of fuzzy mapping rules and fuzzy implication rules can be seen from the difference in their inference behavior. Even though these two types of rules behave the same when their antecedents are satisfied, they behave differently when their antecedents are not satisfied. Example: Implication rule, Mapping rule (logic representation) (procedural representation) Given:x [1,3] y [7,8], Stm: If x [1,3], Then y [7,8] Input: x=5 Variable value: x = 5 Infer: y is unkown (y [0,10]) Execution result: no action
3 Fuzzy Implication Rules Any logic system has two major components: 1. a formal language for constructing statements about the world, 2. a set of inference mechanisms for inferring additional statements about the world from those already given. Fuzzy logic is the most commonly used reasoning scheme in applications of fuzzy logic (narrow sense). The subject is complicated by the fact that there isn t a unique definition of fuzzy implications.
4 Fuzzy Implication Rules An important goal of fuzzy logic is to be able to make reasonable inference even when the condition of an implication rule is partially satisfied. This capability is sometimes referred to as approximate reasoning. This is achieved in fuzzy logic by two related techniques: 1. representing the meaning of a fuzzy implication rule using a fuzzy relation, and 2. obtaining an inferred conclusion by applying the compositional rule of inference to the fuzzy implication relation.
5 Fuzzy Implication Rules Fuzzy rulebased inference is a generalization of a logical reasoning scheme (inference) called modus ponens (MP) and modus tollens (MT). It combines the conclusion of multiple fuzzy rules in a manner similar to linear interpolation. For example: Rule: If a person s IQ is high Then the person is smart Fact: Jack s IQ is high Infer: Jack is smart. Rule: If a person s IQ is high Then the person is smart Fact: Jack is not smart Infer: Jack s IQ is not high.
6 Fuzzy Implication Rules First, these inferences insist on perfect matching. However, common sense reasoning suggest that we can infer Jack is more or less smart when the Jack s IQ is more or less high is given. Secondly, these inferences cannot handle uncertainty. For instance, if Jack told us his IQ is high but cannot provide documents supporting the claim, we may be somewhat uncertain about the claim. Under such a circumstance, however, ordinary logic cannot reason about the uncertainty.
7 Fuzzy Implication Rules These limitations motivated L.A. Zadeh to develop a reasoning scheme that generalizes classical logic so that It can conduct commonsense reasoning under partial matching, and It can reason about the certainty degree of a statement In particular, logic implications are generalized to allow partial matching. Rule: A person s IQ is high the person is smart Fact: Jack s IQ is somewhat high Infer: Jack is somewhat smart
8 Fuzzy Implication Rules The second limitation of logic (i.e., inability to deal with uncertainty) has motivated another extension to classical logic: multivalued logic. Since fuzzy logic also generalizes the truthvalues in classical logic beyond true and false, it is related to multivalued logic. However, fuzzy logic differs from multivalued logic in that it also addresses the first limitation of logic (i.e., restricted to perfect matching) by using linguistic variables in its antecedent. Consequently, the statement in the antecedent describes an elastic condition that can be partially satisfied.
9 Fuzzy Implication Rules Other approaches for reasoning under uncertainty include: 1. Bayesian probabilistic inference, 2. DempsterShafer theory, 3. nonmonotonic logic. Fuzzy logic, among these, is unique in that it addresses both the uncertainty management problem and the partial matching issue.
10 Fuzzy Implication Rules Let us consider an implication involving fuzzy sets (i.e., fuzzy implication): (x is A) (y is B) where A and B are fuzzy subsets of U and V, respectively. This implication also specifies the possibility of various pointtopoint implications. The possibilities are a matter of degree. Therefore, the meaning of the fuzzy implication can be represented by an implication relation R defined as R l (x i,y j ) = Π l ((x = x i ) (y = y j )) Where Π l denotes the possibility distribution imposed by the implication.
11 Fuzzy Implication Rules In fuzzy logic, this possibility distribution is constructed from the truth values of the instantiated implications obtained by replacing variables in the implication (i.e., x and y) with pairs of their possible values (i.e., x i and y j ): Π ((x = x i ) (y = y j )) = t ((x i is A) (y j is B)) where t denotes the truth value of a proposition. For the convenience of our discussion, we refer to the truth values as α i and β j as follows: t(x i is A) = α i t(y j is B) = β j t((x i is A) (y j is B)) = I(α i,β j ) we call the function I an implication function.
12 Fuzzy Implication Rules There is not a unique definition for implication function. Different implication functions lead to different fuzzy implication relations. Various definitions of implication functions have been developed from both the fuzzy logic and multivalued logic research communities. However, all of them at least satisfy the following rules: I(0, β j ) = 1 I(α i,1) = 1
13 Given a possibility distribution of the variable X and the implication possibility from X to Y, we infer the possibility distribution of Y. Given: X = x i is possible AND Infer: X = x i Y = y j is possible Y = y j is possible More generally, we have Given: Infer: Π(X= x i ) = a AND Π(X = x i Y = y j ) = b Π(Y = y j ) a b Where is a fuzzy conjunction operator.
14 When different values of X imply an identical value of Y say y j with potential varying possibility degrees, these inferred possibilities about Y = y j need to be combined using fuzzy disjunction. Hence, the complete formula for computing the inferred possibility distribution of Y is Π(Y = y j ) = xi (Π(X= x i ) Π((X = x i Y = y j ))) which is the compositional rule of inference.
15 Even though both fuzzy implication and fuzzy mapping rules use the compositional rule of inference to compute their inference results, their usage differ in two ways. First, the compositional rule of inference is applied to individual implication rules, while composition is applied to a set of fuzzy mapping rules that approximate a functional mapping. Second, the fuzzy relation of a fuzzy mapping rule is a Cartesian product of the rule s antecedent and its consequent part. An entry in the fuzzy implication relation, however, is the possibility that a particular input value implies a particular output value.
16 Criteria of fuzzy Implications: The criteria of desired inference involving fuzzy implication results can be grouped into six: 1. The basic criterion of modus ponens 2. The generalized criterion of modus ponens involving hedges, 3. The mismatch criterion 4. The basic criterion of modus tolens 5. The generalized criterion of modus tolens involving hedges, and 6. The chaining criterion of implications
17 1. The basic criterion of modus ponens The basic criterion of modus ponens Given: x is A y is B x is A Infer: y is B
18 2. The generalized criterion of modus ponens involving hedges, Given: x is A y is B x is very A Infer: y is very B Ex: If the color of a tomato is red, Then the tomato is ripe The color of this tomato is very red Infer: This tomato is very ripe Or Given: x is A y is B x is very A Infer: y is B Ex: If the color of a tomato is red, then the tomato is ripe The color of this tomato is more or less red Infer: This tomato is ripe
19 A more general version of criterion is to state that the inference result is desired to be the consequent whenever the given fact about x is a subset of A. Given: Infer: x is A y is B x is A A A y is B
20 3. The mismatch criterion Given: x is A y is B x is not A Infer: y is V (unkown) Where V is the universe of discourse of y.
21 4. The basic criterion of modus tolens Given: Infer: x is A y is B y is not B x is not A
22 5. The generalized criterion of modus tolens involving hedges, Given: x is A y is B y is not (very B) Infer: x is not (very A)
23 6. Given: x is A y is B y is B Infer: x is U (unkown) Where U is the universe of discourse of x.
24 7. Chaining: Given: x is A y is B y is B z is C Infer: x is A z is C
25 Fuzzy implications can be classified into three families. 1. The first family of fuzzy implication is obtained by generalizing implications in twovalued logic to fuzzy logic. A material implication p q is defined as p q. Generalizing this to fuzzy logic is defined as follows: t(p q) = t( p q). More specifically, fuzzy implications in this family can be generically defined as: t (x i is A y j is B) = t( (x i is A) (y j is B)) = ((1 μ A (x i )) μ A (y j ))
26 The second family of fuzzy implication is based on logic equivalence between implications implication p q, defined as p (p q). Fuzzy implications in this family thus have the following form: t (x i is A y j is B) = t( (x i is A) [(x i is A) (y j is B)] = (1 μ A (x i )) (μ A (x i ) μ A (y j ))
27 The third family of fuzzy implication generalizes the standard sequence of many valued logic and its variants. The implication in this logic system is defined to be true whenever the consequent is as true as or truer than the antecedent. This property is important since it allows the following tautology: a logic formula always implies itself, regardless of its truthvalue. The fuzzy implication function in this family can all be described in the following form: t (x i is A y j is B) = sup {α α [0,1], α t(x i is A) t (y j is B)} = sup {α α [0,1], α μ A (x i ) μ B (y j )}
28 Major Fuzzy Implication Functions: We introduce below several major implication functions in these families. 1. Zadeh s arithmetic fuzzy implication (family 1) t (x i is A y j is B) = 1 (1 (μ A (x i )) + μ B (y j )) 2. Zadeh s maximum fuzzy implication (Family 2) t (x i is A y j is B) = (1 μ A (x i )) (μ A (x i ) μ B (y j )), using min for fuzzy conjunction and max for fuzzy disjunction.
29
30 Example: Let x and y be two variables taking values from U and V respectively, where U = {1,2,3,4} and V = {0,10,20}. A and B are fuzzy subsets of U and V, respectively, defined as follows: A = 1/ / /3 B = 0.5/10 + 1/20 Consider the following fuzzy implication rule: R1: If x is A Then y is B 1. Give the complete formula for computing the inferred possibility distribution of y (the compositional rule of inference). Then use the compositional rule of inference to compute the result of y if the value of x is VeryA (VeryA = 1/ / /3). Use the supmin compositional operator to infer the value of y.
31 5. Using the Zadeh s maximum fuzzy implication operator, construct the fuzzy implication relation for R1. t(x i is A y j is B) = 1 ((1μ A (x i )) μ B (y j )) R1: If x is A Then y is B A = 1/ / /3, B = 0.5/10 + 1/20 y = VeryA R = [ ] o y = [ ]
32 5. Using the Zadeh s maximum fuzzy implication operator, construct the fuzzy implication relation for R1. t(x i is A y j is B) = (1μ A (x i )) (μ A (x i ) μ B (y j )) R1: If x is A Then y is B A = 1/ / /3 B = 0.5/10 + 1/20 y = VeryA R = [ ] y = [ ] o
33 2. Construct the fuzzy implication relation R1 using standard sequence fuzzy implication operator. Then use the compositional rule of inference to compute the result of y if the value of x is VeryA using the standard sequence fuzzy implication. 1 if (μ A (x i ) μ B (y j )), t(x i is A y j is B)= 0 if (μ A (x i ) > μ B (y j )), R1: If x is A Then y is B A = 1/ / /3 B = 0.5/10 + 1/20 y = VeryA R = [ ] y = [ ] o
34 3. Using the Godelian s fuzzy implication operator, construct the fuzzy implication relation for R1. 1 if (μ A (x i ) μ B (y j )), t(x i is A y j is B) = μ B (y i ) if (μ A (x i ) > μ B (y j )), R1: If x is A Then y is B A = 1/ / /3 B = 0.5/10 + 1/20 y = VeryA R = [ ] o y = [ ]
35 4. Using the Goguen s fuzzy implication operator, construct the fuzzy implication relation for R1. 1 (μ A (x i ) μ B (y j )), t(x i is A y j is B) = μ B (y i )/ μ A (x i ) (μ A (x i ) > μ B (y j )), R1: If x is A Then y is B A = 1/ / /3 B = 0.5/10 + 1/20 y = VeryA R = [ ] o y = [ ]
36 All the latter three fuzzy implications came from multivalued logic systems. Even though implication functions in multivalued logic systems can be used for constructing fuzzy implication relations, approximate reasoning in fuzzy logic is fundamentally different from logic inference in multivalued logic. Approximate reasoning infers possible values of a variable, whereas multivalued logic infers the truthvalues of propositions. Approximate reasoning benefits from the following important concepts and techniques in fuzzy logic: the compositional rule of inference, fuzzy relations, and possibility distributions. Without them, approximate reasoning would not have been possible. Among the five fuzzy implication functions, the standard sequence fuzzy implication satisfies most criteria.
37 Fuzzy IfThen Rules Fuzzy Implication Rules Fuzzy Mapping Rules Purpose Generalizes implications for handling imprecision Approximate functional mappings Desired Inference Generalizes modus ponens and modus tollens Forward only Application Diagnostics, highlevel decision making Control, system modeling, and signal processing Related Disciplines Classical logic, multivalued logic (other extended logic systems) System ID, piecewise linear interpolation, neural networks Typical Design Approach Designed individually Designed as a rule set Suitable Problem Domains Domains with continuous and discrete variables Continuous nonlinear domains
38
39 A = 1/ / /3 B = 0.5/10 + 1/20 R1: If x is A Then y is B y = VeryA R = [ ] y = [ ] o VeryA = 1/ / /3). B= A= R = (A x B) = (0.0/(1,0) + 0.5/(1,10) + 1/(1,20) 0.0/(2,0) + 0.5/(2,10) /(2,20) 0.0/(3,0) + 0.4/(3,10) /(3,20) 0.0/(4,0) + 0.0/(4,10) /(4,20))
Automating Software Development Process Using Fuzzy Logic
Automating Software Development Process Using Fuzzy Logic Francesco Marcelloni 1 and Mehmet Aksit 2 1 Dipartimento di Ingegneria dell Informazione, University of Pisa, Via Diotisalvi, 256122, Pisa, Italy,
More informationDISCRETE MATHEMATICS W W L CHEN
DISCRETE MATHEMATICS W W L CHEN c W W L Chen, 1982, 2008. This chapter originates from material used by the author at Imperial College, University of London, between 1981 and 1990. It is available free
More informationFuzzy decision trees
Fuzzy decision trees Catalin Pol Abstract Decision trees are arguably one of the most popular choices for learning and reasoning systems, especially when it comes to learning from discrete valued (feature
More informationLikewise, we have contradictions: formulas that can only be false, e.g. (p p).
CHAPTER 4. STATEMENT LOGIC 59 The rightmost column of this truth table contains instances of T and instances of F. Notice that there are no degrees of contingency. If both values are possible, the formula
More informationRules of Inference Friday, January 18, 2013 Chittu Tripathy Lecture 05
Rules of Inference Today s Menu Rules of Inference Quantifiers: Universal and Existential Nesting of Quantifiers Applications Old Example ReRevisited Our Old Example: Suppose we have: All human beings
More informationFundamentals of Mathematics Lecture 6: Propositional Logic
Fundamentals of Mathematics Lecture 6: Propositional Logic GuanShieng Huang National Chi Nan University, Taiwan Spring, 2008 1 / 39 Connectives Propositional Connectives I 1 Negation: (not A) A A T F
More informationProblems often have a certain amount of uncertainty, possibly due to: Incompleteness of information about the environment,
Uncertainty Problems often have a certain amount of uncertainty, possibly due to: Incompleteness of information about the environment, E.g., loss of sensory information such as vision Incorrectness in
More informationCourse Outline Department of Computing Science Faculty of Science. COMP 37103 Applied Artificial Intelligence (3,1,0) Fall 2015
Course Outline Department of Computing Science Faculty of Science COMP 710  Applied Artificial Intelligence (,1,0) Fall 2015 Instructor: Office: Phone/Voice Mail: EMail: Course Description : Students
More informationFirst Order Predicate Logic. Lecture 4
First Order Predicate Logic Lecture 4 First Order Predicate Logic Limitation of Propositional Logic The facts: peter is a man, paul is a man, john is a man can be symbolized by P, Q and R respectively
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 informationChapter I Logic and Proofs
MATH 1130 1 Discrete Structures Chapter I Logic and Proofs Propositions A proposition is a statement that is either true (T) or false (F), but or both. s Propositions: 1. I am a man.. I am taller than
More informationSoft Computing in Economics and Finance
Ludmila Dymowa Soft Computing in Economics and Finance 4y Springer 1 Introduction 1 References 5 i 2 Applications of Modern Mathematics in Economics and Finance 7 2.1 Fuzzy'Set Theory and Applied Interval
More informationn logical not (negation) n logical or (disjunction) n logical and (conjunction) n logical exclusive or n logical implication (conditional)
Discrete Math Review Discrete Math Review (Rosen, Chapter 1.1 1.6) TOPICS Propositional Logic Logical Operators Truth Tables Implication Logical Equivalence Inference Rules What you should know about propositional
More informationDeferring Elimination of Design Alternatives in Object Oriented Methods
Deferring Elimination of Design Alternatives in Object Oriented Methods Mehmet Aksit and Francesco Marcelloni TRESE project, Department of Computer Science, University of Twente, P.O. Box 217, 7500 AE
More informationTruth Conditional Meaning of Sentences. Ling324 Reading: Meaning and Grammar, pg
Truth Conditional Meaning of Sentences Ling324 Reading: Meaning and Grammar, pg. 6987 Meaning of Sentences A sentence can be true or false in a given situation or circumstance. (1) The pope talked to
More informationBeyond Propositional Logic Lukasiewicz s System
Beyond Propositional Logic Lukasiewicz s System Consider the following set of truth tables: 1 0 0 1 # # 1 0 # 1 1 0 # 0 0 0 0 # # 0 # 1 0 # 1 1 1 1 0 1 0 # # 1 # # 1 0 # 1 1 0 # 0 1 1 1 # 1 # 1 Brandon
More informationInference Rules and Proof Methods
Inference Rules and Proof Methods Winter 2010 Introduction Rules of Inference and Formal Proofs Proofs in mathematics are valid arguments that establish the truth of mathematical statements. An argument
More informationFS I: Fuzzy Sets and Fuzzy Logic. L.A.Zadeh, Fuzzy Sets, Information and Control, 8(1965)
FS I: Fuzzy Sets and Fuzzy Logic Fuzzy sets were introduced by Zadeh in 1965 to represent/manipulate data and information possessing nonstatistical uncertainties. L.A.Zadeh, Fuzzy Sets, Information and
More informationA FUZZY LOGIC APPROACH FOR SALES FORECASTING
A FUZZY LOGIC APPROACH FOR SALES FORECASTING ABSTRACT Sales forecasting proved to be very important in marketing where managers need to learn from historical data. Many methods have become available for
More informationHandout #1: Mathematical Reasoning
Math 101 Rumbos Spring 2010 1 Handout #1: Mathematical Reasoning 1 Propositional Logic A proposition is a mathematical statement that it is either true or false; that is, a statement whose certainty or
More informationThe Foundations: Logic and Proofs. Chapter 1, Part III: Proofs
The Foundations: Logic and Proofs Chapter 1, Part III: Proofs Rules of Inference Section 1.6 Section Summary Valid Arguments Inference Rules for Propositional Logic Using Rules of Inference to Build Arguments
More informationFuzzy Set Theory : Soft Computing Course Lecture 29 34, notes, slides RC Chakraborty, Aug.
Fuzzy Set Theory : Soft Computing Course Lecture 29 34, notes, slides www.myreaders.info/, RC Chakraborty, email rcchak@gmail.com, Aug. 10, 2010 http://www.myreaders.info/html/soft_computing.html www.myreaders.info
More informationAPPLICATION SCHEMES OF POSSIBILITY THEORYBASED DEFAULTS
APPLICATION SCHEMES OF POSSIBILITY THEORYBASED DEFAULTS ChurnJung Liau Institute of Information Science, Academia Sinica, Taipei 115, Taiwan email : liaucj@iis.sinica.edu.tw Abstract In this paper,
More informationLOGICAL INFERENCE & PROOFs. Debdeep Mukhopadhyay Dept of CSE, IIT Madras
LOGICAL INFERENCE & PROOFs Debdeep Mukhopadhyay Dept of CSE, IIT Madras Defn A theorem is a mathematical assertion which can be shown to be true. A proof is an argument which establishes the truth of a
More informationCHAPTER 5 FUZZY LOGIC CONTROLLER FOR THE CONICAL TANK PROCESS
99 CHAPTER 5 FUZZY LOGIC CONTROLLER FOR THE CONICAL TANK PROCESS 5.1 INTRODUCTION Fuzzy Logic Controllers are normally preferred for control applications, due to their fault tolerance, knowledge representation,
More informationEMPLOYEE PERFORMANCE APPRAISAL SYSTEM USING FUZZY LOGIC
EMPLOYEE PERFORMANCE APPRAISAL SYSTEM USING FUZZY LOGIC ABSTRACT Adnan Shaout* and Mohamed Khalid Yousif** *The Department of Electrical and Computer Engineering The University of Michigan Dearborn, MI,
More informationDiscrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 1
CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 1 Course Outline CS70 is a course on Discrete Mathematics and Probability for EECS Students. The purpose of the course
More information13.3 Inference Using Full Joint Distribution
191 The probability distribution on a single variable must sum to 1 It is also true that any joint probability distribution on any set of variables must sum to 1 Recall that any proposition a is equivalent
More informationCSE 191, Class Note 01 Propositional Logic Computer Sci & Eng Dept SUNY Buffalo
Propositional Logic CSE 191, Class Note 01 Propositional Logic Computer Sci & Eng Dept SUNY Buffalo c Xin He (University at Buffalo) CSE 191 Discrete Structures 1 / 37 Discrete Mathematics What is Discrete
More informationdef: An axiom is a statement that is assumed to be true, or in the case of a mathematical system, is used to specify the system.
Section 1.5 Methods of Proof 1.5.1 1.5 METHODS OF PROOF Some forms of argument ( valid ) never lead from correct statements to an incorrect. Some other forms of argument ( fallacies ) can lead from true
More informationCHAPTER 3. Methods of Proofs. 1. Logical Arguments and Formal Proofs
CHAPTER 3 Methods of Proofs 1. Logical Arguments and Formal Proofs 1.1. Basic Terminology. An axiom is a statement that is given to be true. A rule of inference is a logical rule that is used to deduce
More informationMATHS 315 Mathematical Logic
MATHS 315 Mathematical Logic Second Semester, 2006 Contents 2 Formal Statement Logic 1 2.1 Post production systems................................. 1 2.2 The system L.......................................
More informationCHAPTER 1. Logic, Proofs Propositions
CHAPTER 1 Logic, Proofs 1.1. Propositions A proposition is a declarative sentence that is either true or false (but not both). For instance, the following are propositions: Paris is in France (true), London
More informationCHAPTER 2. Logic. 1. Logic Definitions. Notation: Variables are used to represent propositions. The most common variables used are p, q, and r.
CHAPTER 2 Logic 1. Logic Definitions 1.1. Propositions. Definition 1.1.1. A proposition is a declarative sentence that is either true (denoted either T or 1) or false (denoted either F or 0). Notation:
More informationIntroduction to Predicate Calculus
Introduction to Predicate Calculus 1 Motivation Last time, we discuss the need for a representation language that was declarative, expressively adequate, unambiguous, contextindependent, and compositional.
More informationRelations and Functions
Section 5. Relations and Functions 5.1. Cartesian Product 5.1.1. Definition: Ordered Pair Let A and B be sets and let a A and b B. An ordered pair ( a, b) is a pair of elements with the property that:
More informationConventional Sets and Fuzzy Sets
Conventional Sets and Conventional Sets A set is a collection of things, for example the room temperature, the set of all real numbers, etc. 2 Conventional Sets Such collection of things are called the
More informationCS 441 Discrete Mathematics for CS Lecture 5. Predicate logic. CS 441 Discrete mathematics for CS. Negation of quantifiers
CS 441 Discrete Mathematics for CS Lecture 5 Predicate logic Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Negation of quantifiers English statement: Nothing is perfect. Translation: x Perfect(x)
More informationIntroduction to Fuzzy Control
Introduction to Fuzzy Control Marcelo Godoy Simoes Colorado School of Mines Engineering Division 1610 Illinois Street Golden, Colorado 804011887 USA Abstract In the last few years the applications of
More information1 Propositional Logic
1 Propositional Logic Propositions 1.1 Definition A declarative sentence is a sentence that declares a fact or facts. Example 1 The earth is spherical. 7 + 1 = 6 + 2 x 2 > 0 for all real numbers x. 1 =
More informationCHAPTER 7 GENERAL PROOF SYSTEMS
CHAPTER 7 GENERAL PROOF SYSTEMS 1 Introduction Proof systems are built to prove statements. They can be thought as an inference machine with special statements, called provable statements, or sometimes
More informationCSI 2101 Discrete Structures Winter 2012
CSI 2101 Discrete Structures Winter 2012 Prof. Lucia Moura University of Ottawa Homework Assignment #1 (100 points, weight 5%) Due: Thursday Feb 9, at 1:00 p.m. (in lecture); assignments with lateness
More informationOptimization under fuzzy ifthen rules
Optimization under fuzzy ifthen rules Christer Carlsson christer.carlsson@abo.fi Robert Fullér rfuller@abo.fi Abstract The aim of this paper is to introduce a novel statement of fuzzy mathematical programming
More informationDiscrete Mathematics, Chapter 5: Induction and Recursion
Discrete Mathematics, Chapter 5: Induction and Recursion Richard Mayr University of Edinburgh, UK Richard Mayr (University of Edinburgh, UK) Discrete Mathematics. Chapter 5 1 / 20 Outline 1 Wellfounded
More informationDiscrete Mathematics Lecture 1 Logic of Compound Statements. Harper Langston New York University
Discrete Mathematics Lecture 1 Logic of Compound Statements Harper Langston New York University Administration Class Web Site http://cs.nyu.edu/courses/summer05/g22.2340001/ Mailing List Subscribe at
More informationMATHEMATICAL INDUCTION AND DIFFERENCE EQUATIONS
1 CHAPTER 6. MATHEMATICAL INDUCTION AND DIFFERENCE EQUATIONS 1 INSTITIÚID TEICNEOLAÍOCHTA CHEATHARLACH INSTITUTE OF TECHNOLOGY CARLOW MATHEMATICAL INDUCTION AND DIFFERENCE EQUATIONS 1 Introduction Recurrence
More informationCorrespondence analysis for strong threevalued logic
Correspondence analysis for strong threevalued logic A. Tamminga abstract. I apply Kooi and Tamminga s (2012) idea of correspondence analysis for manyvalued logics to strong threevalued logic (K 3 ).
More informationMathematical Induction
Mathematical Induction MAT30 Discrete Mathematics Fall 016 MAT30 (Discrete Math) Mathematical Induction Fall 016 1 / 19 Outline 1 Mathematical Induction Strong Mathematical Induction MAT30 (Discrete Math)
More informationLogic in general. Inference rules and theorem proving
Logical Agents Knowledgebased agents Logic in general Propositional logic Inference rules and theorem proving First order logic Knowledgebased agents Inference engine Knowledge base Domainindependent
More informationLogic & Discrete Math in Software Engineering (CAS 701) Dr. Borzoo Bonakdarpour
Logic & Discrete Math in Software Engineering (CAS 701) Background Dr. Borzoo Bonakdarpour Department of Computing and Software McMaster University Dr. Borzoo Bonakdarpour Logic & Discrete Math in SE (CAS
More informationMath 55: Discrete Mathematics
Math 55: Discrete Mathematics UC Berkeley, Fall 2011 Homework # 1, due Wedneday, January 25 1.1.10 Let p and q be the propositions The election is decided and The votes have been counted, respectively.
More informationDiscrete Mathematics, Chapter : Propositional Logic
Discrete Mathematics, Chapter 1.1.1.3: Propositional Logic Richard Mayr University of Edinburgh, UK Richard Mayr (University of Edinburgh, UK) Discrete Mathematics. Chapter 1.11.3 1 / 21 Outline 1 Propositions
More informationThe Predicate Calculus in AI
Last time, we: The Predicate Calculus in AI Motivated the use of Logic as a representational language for AI (Can derive new facts syntactically  simply by pushing symbols around) Described propositional
More informationSection 1. Statements and Truth Tables. Definition 1.1: A mathematical statement is a declarative sentence that is true or false, but not both.
M3210 Supplemental Notes: Basic Logic Concepts In this course we will examine statements about mathematical concepts and relationships between these concepts (definitions, theorems). We will also consider
More informationContinuous Random Variables and Probability Distributions. Stat 4570/5570 Material from Devore s book (Ed 8) Chapter 4  and Cengage
4 Continuous Random Variables and Probability Distributions Stat 4570/5570 Material from Devore s book (Ed 8) Chapter 4  and Cengage Continuous r.v. A random variable X is continuous if possible values
More informationCpSc810 Goddard Notes Chapter 7. Expert Systems
CpSc810 Goddard Notes Chapter 7 Expert Systems Expert systems are designed to provide expert quality performance on domainspecific problems. In this chapter we look at the structure of expert systems focusing
More information3. Mathematical Induction
3. MATHEMATICAL INDUCTION 83 3. Mathematical Induction 3.1. First Principle of Mathematical Induction. Let P (n) be a predicate with domain of discourse (over) the natural numbers N = {0, 1,,...}. If (1)
More informationDefinition 10. A proposition is a statement either true or false, but not both.
Chapter 2 Propositional Logic Contrariwise, continued Tweedledee, if it was so, it might be; and if it were so, it would be; but as it isn t, it ain t. That s logic. (Lewis Carroll, Alice s Adventures
More information2. Propositional Equivalences
2. PROPOSITIONAL EQUIVALENCES 33 2. Propositional Equivalences 2.1. Tautology/Contradiction/Contingency. Definition 2.1.1. A tautology is a proposition that is always true. Example 2.1.1. p p Definition
More informationCS510 Software Engineering
CS510 Software Engineering Propositional Logic Asst. Prof. Mathias Payer Department of Computer Science Purdue University TA: Scott A. Carr Slides inspired by Xiangyu Zhang http://nebelwelt.net/teaching/15cs510se
More informationCOMPUTATIONAL METHODS FOR A MATHEMATICAL THEORY OF EVIDENCE
COMPUTATIONAL METHODS FOR A MATHEMATICAL THEORY OF EVIDENCE Jeffrey A. Barnett USC/lnformation Sciences Institute ABSTRACT: Many knowledgebased expert systems employ numerical schemes to represent evidence,
More informationFoundations of Computing Discrete Mathematics Solutions to exercises for week 2
Foundations of Computing Discrete Mathematics Solutions to exercises for week 2 Agata Murawska (agmu@itu.dk) September 16, 2013 Note. The solutions presented here are usually one of many possiblities.
More informationBetting on Fuzzy and Manyvalued Propositions
Betting on Fuzzy and Manyvalued Propositions Peter Milne 1 Introduction In a 1968 article, Probability Measures of Fuzzy Events, Lotfi Zadeh proposed accounts of absolute and conditional probability for
More informationFourier Series. Chapter Some Properties of Functions Goal Preliminary Remarks
Chapter 3 Fourier Series 3.1 Some Properties of Functions 3.1.1 Goal We review some results about functions which play an important role in the development of the theory of Fourier series. These results
More informationPrediction of DDoS Attack Scheme
Chapter 5 Prediction of DDoS Attack Scheme Distributed denial of service attack can be launched by malicious nodes participating in the attack, exploit the lack of entry point in a wireless network, and
More informationDeductive Systems. Marco Piastra. Artificial Intelligence. Artificial Intelligence  A.A Deductive Systems [1]
Artificial Intelligence Deductive Systems Marco Piastra Artificial Intelligence  A.A. 2012 Deductive Systems 1] Symbolic calculus? A wff is entailed by a set of wff iff every model of is also model of
More information31 is a prime number is a mathematical statement (which happens to be true).
Chapter 1 Mathematical Logic In its most basic form, Mathematics is the practice of assigning truth to welldefined statements. In this course, we will develop the skills to use known true statements to
More informationApproximation Algorithms: LP Relaxation, Rounding, and Randomized Rounding Techniques. My T. Thai
Approximation Algorithms: LP Relaxation, Rounding, and Randomized Rounding Techniques My T. Thai 1 Overview An overview of LP relaxation and rounding method is as follows: 1. Formulate an optimization
More information1 Proposition, Logical connectives and compound statements
Discrete Mathematics: Lecture 4 Introduction to Logic Instructor: Arijit Bishnu Date: July 27, 2009 1 Proposition, Logical connectives and compound statements Logic is the discipline that deals with the
More informationModels for Inexact Reasoning. Fuzzy Logic Lesson 1 Crisp and Fuzzy Sets. Master in Computational Logic Department of Artificial Intelligence
Models for Inexact Reasoning Fuzzy Logic Lesson 1 Crisp and Fuzzy Sets Master in Computational Logic Department of Artificial Intelligence Origins and Evolution of Fuzzy Logic Origin: Fuzzy Sets Theory
More informationFUZZY DYNAMIC PROGRAMMING MODEL FOR OPTIMAL OPERATION OF A MULTIPURPOSE RESERVOIR
FUZZY DYNAMIC PROGRAMMING MODEL FOR OPTIMAL OPERATION OF A MULTIPURPOSE RESERVOIR N.V. UMAMAHESH Water & Environment Division, Department of Civil Engineering, National Institute of Technology Warangal,
More informationWhat is logic? Propositional Logic. Negation. Propositions. This is a contentious question! We will play it safe, and stick to:
Propositional Logic This lecture marks the start of a new section of the course. In the last few lectures, we have had to reason formally about concepts. This lecture introduces the mathematical language
More informationNPCompleteness and Cook s Theorem
NPCompleteness and Cook s Theorem Lecture notes for COM3412 Logic and Computation 15th January 2002 1 NP decision problems The decision problem D L for a formal language L Σ is the computational task:
More informationWhat Is Induction and Why Study It?
1 What Is Induction and Why Study It? Evan Heit Why study induction, and indeed, why should there be a whole book devoted to the study of induction? The first reason is that inductive reasoning corresponds
More informationResolution in Propositional and FirstOrder Logic
Resolution in Propositional and FirstOrder Logic Inference rules Logical inference creates new sentences that logically follow from a set of sentences (KB) An inference rule is sound if every sentence
More informationSatisfiability and Validity
6.825 Techniques in Artificial Intelligence Satisfiability and Validity Lecture 4 1 Last time we talked about propositional logic. There's no better way to empty out a room than to talk about logic. So
More informationLogic, Sets, and Proofs
Logic, Sets, and Proofs David A. Cox and Catherine C. McGeoch Amherst College 1 Logic Logical Statements. A logical statement is a mathematical statement that is either true or false. Here we denote logical
More informationvertex, 369 disjoint pairwise, 395 disjoint sets, 236 disjunction, 33, 36 distributive laws
Index absolute value, 135 141 additive identity, 254 additive inverse, 254 aleph, 466 algebra of sets, 245, 278 antisymmetric relation, 387 arcsine function, 349 arithmetic sequence, 208 arrow diagram,
More informationFunctional localization and double dissociations: The relationship between internal structure and behavior
Brain and Cognition 57 (2005) 146 150 www.elsevier.com/locate/b&c Functional localization and double dissociations: The relationship between internal structure and behavior David A. Medler a, *, Michael
More informationChapter 1 LOGIC AND PROOF
Chapter 1 LOGIC AND PROOF To be able to understand mathematics and mathematical arguments, it is necessary to have a solid understanding of logic and the way in which known facts can be combined to prove
More informationMath 504, Fall 2013 HW 3
Math 504, Fall 013 HW 3 1. Let F = F (x) be the field of rational functions over the field of order. Show that the extension K = F(x 1/6 ) of F is equal to F( x, x 1/3 ). Show that F(x 1/3 ) is separable
More informationCobbDouglas Production Function
CobbDouglas Production Function Bao Hong, Tan November 20, 2008 1 Introduction In economics, the CobbDouglas functional form of production functions is widely used to represent the relationship of an
More informationOn Development of Fuzzy Relational Database Applications
On Development of Fuzzy Relational Database Applications Srdjan Skrbic Faculty of Science Trg Dositeja Obradovica 3 21000 Novi Sad Serbia shkrba@uns.ns.ac.yu Aleksandar Takači Faculty of Technology Bulevar
More informationOutline. Uncertainty. Uncertainty. Making decisions under uncertainty. Probability. Methods for handling uncertainty
Outline Uncertainty Chapter 13 Uncertainty Probability Syntax and Semantics Inference Independence and Bayes' Rule Uncertainty Let action A t = leave for airport t minutes before flight Will A t get me
More informationFuzzy Priority CPU Scheduling Algorithm
www.ijcsi.org 386 Fuzzy CPU Scheduling Algorithm Bashir Alam 1, M.N. Doja 1, R. Biswas 3, M. Alam 4 1 Department of Computer Engineering, Jamia Millia Islamia 2 Department of Computer Engineering, Jamia
More information2.1.1 Examples of Sets and their Elements
Chapter 2 Set Theory 2.1 Sets The most basic object in Mathematics is called a set. As rudimentary as it is, the exact, formal definition of a set is highly complex. For our purposes, we will simply define
More informationChapter 1. Logic and Proof
Chapter 1. Logic and Proof 1.1 Remark: A little over 100 years ago, it was found that some mathematical proofs contained paradoxes, and these paradoxes could be used to prove statements that were known
More informationPrime Numbers. Chapter Primes and Composites
Chapter 2 Prime Numbers The term factoring or factorization refers to the process of expressing an integer as the product of two or more integers in a nontrivial way, e.g., 42 = 6 7. Prime numbers are
More informationArtificial Intelligence
Artificial Intelligence ICS461 Fall 2010 Nancy E. Reed nreed@hawaii.edu 1 Lecture #13 Uncertainty Outline Uncertainty Probability Syntax and Semantics Inference Independence and Bayes' Rule Uncertainty
More informationArtificial Intelligence Automated Reasoning
Artificial Intelligence Automated Reasoning Andrea Torsello Automated Reasoning Very important area of AI research Reasoning usually means deductive reasoning New facts are deduced logically from old ones
More informationChapter (3) Data Modeling Using the EntityRelationship Model
Chapter (3) Data Modeling Using the EntityRelationship Model Objectives Presenting the role of highlevel conceptual data models in database design. Understanding the traditional approach of concentrating
More informationApplications of Methods of Proof
CHAPTER 4 Applications of Methods of Proof 1. Set Operations 1.1. Set Operations. The settheoretic operations, intersection, union, and complementation, defined in Chapter 1.1 Introduction to Sets are
More informationPRINCIPLE OF MATHEMATICAL INDUCTION
Chapter 4 PRINCIPLE OF MATHEMATICAL INDUCTION 4.1 Overview Mathematical induction is one of the techniques which can be used to prove variety of mathematical statements which are formulated in terms of
More informationMATH 55: HOMEWORK #2 SOLUTIONS
MATH 55: HOMEWORK # SOLUTIONS ERIC PETERSON * 1. SECTION 1.5: NESTED QUANTIFIERS 1.1. Problem 1.5.8. Determine the truth value of each of these statements if the domain of each variable consists of all
More informationSome Research Problems in Uncertainty Theory
Journal of Uncertain Systems Vol.3, No.1, pp.310, 2009 Online at: www.jus.org.uk Some Research Problems in Uncertainty Theory aoding Liu Uncertainty Theory Laboratory, Department of Mathematical Sciences
More informationMathematics for Computer Science/Software Engineering. Notes for the course MSM1F3 Dr. R. A. Wilson
Mathematics for Computer Science/Software Engineering Notes for the course MSM1F3 Dr. R. A. Wilson October 1996 Chapter 1 Logic Lecture no. 1. We introduce the concept of a proposition, which is a statement
More informationLecture 16 : Relations and Functions DRAFT
CS/Math 240: Introduction to Discrete Mathematics 3/29/2011 Lecture 16 : Relations and Functions Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT In Lecture 3, we described a correspondence
More informationLinear functions Increasing Linear Functions. Decreasing Linear Functions
3.5 Increasing, Decreasing, Max, and Min So far we have been describing graphs using quantitative information. That s just a fancy way to say that we ve been using numbers. Specifically, we have described
More informationA Semantical Perspective on Verification of Knowledge
A Semantical Perspective on Verification of Knowledge Paul Leemans, Jan Treur, Mark Willems Vrije Universiteit Amsterdam, Department of Artificial Intelligence De Boelelaan 1081a, 1081 HV Amsterdam The
More information