Chapter 2 The Operation of Fuzzy Set

Size: px
Start display at page:

Download "Chapter 2 The Operation of Fuzzy Set"

Transcription

1 Chapter 2 The Operation of Fuzzy Set

2 Standard operations of Fuzzy Set! Complement set! Union Ma[, ]! Intersection Min[, ]! difference between characteristics of crisp fuzzy set operator n law of contradiction n law of ecluded middle X

3 Fuzzy complement! Requirements for complement function n Complement function C: [0,] [0,] C iom C C0, C 0 boundary condition iom C2 a,b [0,] if a < b, then Ca Cb monotonic non-increasing iom C3 C is a continuous function. iom C4 C is involutive. CCa a for all a [0,]

4 Fuzzy complement! Eample of complement function Ca Ca - a Fig 2. Standard complement set function a

5 Fuzzy complement! Eample of complement function n standard complement set function

6 Fuzzy complement! Eample of complement function3 Ca C a 0 for a t for a > t It does not hold C3 and C4 t a

7 Fuzzy union! ioms for union function U : [0,] [0,] [0,] U[, ] iom U U0,0 0, U0,, U,0, U, iom U2 Ua,b Ub,a Commutativity iom U3 If a a and b b, Ua, b Ua, b Function U is a monotonic function. iom U4 UUa, b, c Ua, Ub, c ssociativity iom U5 Function U is continuous. iom U6 Ua, a a idempotency

8 Fuzzy union! Eamples of union function U[, ] Ma[, ], or Ma[, ] X X X Fig 2.6 Visualization of standard union operation

9 Other union operations Probabilistic sum +ˆ lgebraic sum + X, ˆ + n n commutativity, associativity, identity and De Morgan s law +ˆ X X 2 ounded sum old union X, Min[, + ] n n n Commutativity, associativity, identity, and De Morgan s Law X X, not idempotency, distributivity and absorption X

10 3 Drastic sum 4 Hamacher s sum others for, 0 when, 0 when,, X 0, 2, + γ γ γ X Other union operations

11 Fuzzy intersection! ioms for intersection function I:[0,] [0,] [0,] I[, ] iom I I,, I, 0 0, I0, 0, I0, 0 0 iom I2 Ia, b Ib, a, Commutativity holds. iom I3 If a a and b b, Ia, b Ia, b, Function I is a monotonic function. iom I4 IIa, b, c Ia, Ib, c, ssociativity holds. iom I5 I is a continuous function iom I6 Ia, a a, I is idempotency.

12 Fuzzy intersection! Eamples of intersection n standard fuzzy intersection I[, ] Min[, ], or Min[, ] X

13 Other intersection operations lgebraic product Probabilistic product X, n commutativity, associativity, identity and De Morgan s law 2 ounded product old intersection X, Ma[0, + ] n n n commutativity, associativity, identity, and De Morgan s Law, not idempotency, distributivity and absorption

14 3 Drastic product 4 Hamacher s product Other intersection operations <, when 0, when, when, 0, + + γ γ γ

15 Other operations in fuzzy set! Disjunctive sum Fig 2.0 Disjunctive sum of two crisp sets

16 Other operations in fuzzy set! Simple disjunctive sum -, - Min[, ] Min[, ], then Ma{ Min[, ], Min[, ]}

17 Other operations in fuzzy set! Simple disjunctive sum2 e {, 0.2, 2, 0.7, 3,, 4, 0} {, 0.5, 2, 0.3, 3,, 4, 0.} {, 0.8, 2, 0.3, 3, 0, 4, } {, 0.5, 2, 0.7, 3, 0, 4, 0.9} {, 0.2, 2, 0.7, 3, 0, 4, 0} {, 0.5, 2, 0.3, 3, 0, 4, 0.} {, 0.5, 2, 0.7, 3, 0, 4, 0.}

18 Other operations in fuzzy set! Simple disjunctive sum Set Set Set Fig 2. Eample of simple disjunctive sum

19 Other operations in fuzzy set! Eclusive or disjoint sum Δ Set Set Set shaded area Fig 2.2 Eample of disjoint sum eclusive OR sum

20 Other operations in fuzzy set! Eclusive or disjoint sum Δ Set Set Set shaded area {, 0.2, 2, 0.7, 3,, 4, 0} {, 0.5, 2, 0.3, 3,, 4, 0.} {, 0.3, 2, 0.4, 3, 0, 4, 0.} Fig 2.2 Eample of disjoint sum eclusive OR sum

21 Other operations in fuzzy set! Difference in fuzzy set n Difference in crisp set Fig 2.3 difference

22 Other operations in fuzzy set! Simple difference Min[, ] e {, 0.2, 2, 0.7, 3,, 4, 0} {, 0.5, 2, 0.3, 3,, 4, 0.} {, 0.5, 2, 0.7, 3, 0, 4, 0.9} {, 0.2, 2, 0.7, 3, 0, 4, 0}

23 Other operations in fuzzy set! Simple difference2 Set Set Simple difference - : shaded area Fig 2.4 simple difference

24 Other operations in fuzzy set! ounded difference θ Ma[0, - ] Set Set ounded difference : shaded area θ {, 0, 2, 0.4, 3, 0, 4, 0} Fig 2.5 bounded difference θ

25 Distance in fuzzy set! Hamming distance d, n i, X i i i. d, 0 2. d, d, 3. d, C d, + d, C 4. d, 0 e {, 0.4, 2, 0.8, 3,, 4, 0} {, 0.4, 2, 0.3, 3, 0, 4, 0} d,

26 Distance in fuzzy set! Hamming distance : distance and difference of fuzzy set distance between, difference -

27 Distance in fuzzy set! Euclidean distance e! Minkowski distance n i e 2, ] [,,, / w d w X w w , e

28 Cartesian product of fuzzy set! Power of fuzzy set 2 2 [ ], m m [ ], X X! Cartesian product,,, as membership functions of, 2,, n 2,, n n for, 2 2 n., 2,, n Min[,, n 2 n n ]

29 t-norms and t-conorms Definitions for t-norms and t-conorms! t-norm T : [0,] [0,] [0,], y,, y, z [0,] i T, 0 0, T, : boundary condition ii T, y Ty, : commutativity iii, y y T, y T, y : monotonicity iv TT, y, z T, Ty, z : associativity intersection operator 2 algebraic product operator 3 bounded product operator 4 drastic product operator

30 t-norms and t-conorms! t-conorm s-norm T : [0,] [0,] [0,], y,, y, z [0,] i T, 0 0, T, : boundary condition ii T, y Ty, : commutativity iii, y y T, y T, y : monotonicity iv TT, y, z T, Ty, z : associativity union operator 2 algebraic sum operator +ˆ 3 bounded sum operator 4 drastic sum operator 5 disjoint sum operator Δ

31 t-norms and t-conorms E a : minimum Instead of *, if is applied Since this operator meets the previous conditions, it is a t-norm. b : maimum If is applied instead of *, 0 then this becomes a t-conorm.

32 t-norms and t-conorms! Duality of t-norms and t-conorms Law by De Morgane's T T, T T, T, y y y y y y y y y y conorm t y norm t y : T :

Chapter 2: FUZZY SETS

Chapter 2: FUZZY SETS Ch.2: Fuzzy sets 1 Chapter 2: FUZZY SETS Introduction (2.1) Basic Definitions &Terminology (2.2) Set-theoretic Operations (2.3) Membership Function (MF) Formulation & Parameterization (2.4) Complement

More information

Definitions. 03 Logic networks Boolean algebra. Boolean set: B 0,

Definitions. 03 Logic networks Boolean algebra. Boolean set: B 0, 3. Boolean algebra 3 Logic networks 3. Boolean algebra Definitions Boolean functions Properties Canonical forms Synthesis and minimization alessandro bogliolo isti information science and technology institute

More information

CSE 215: Foundations of Computer Science Recitation Exercises Set #9 Stony Brook University. Name: ID#: Section #: Score: / 4

CSE 215: Foundations of Computer Science Recitation Exercises Set #9 Stony Brook University. Name: ID#: Section #: Score: / 4 CSE 215: Foundations of Computer Science Recitation Exercises Set #9 Stony Brook University Name: ID#: Section #: Score: / 4 Unit 14: Set Theory: Definitions and Properties 1. Let C = {n Z n = 6r 5 for

More information

[Ch 6] Set Theory. 1. Basic Concepts and Definitions. 400 lecture note #4. 1) Basics

[Ch 6] Set Theory. 1. Basic Concepts and Definitions. 400 lecture note #4. 1) Basics 400 lecture note #4 [Ch 6] Set Theory 1. Basic Concepts and Definitions 1) Basics Element: ; A is a set consisting of elements x which is in a/another set S such that P(x) is true. Empty set: notated {

More information

Introduction to Fuzzy Logic. IJCAI2018 Tutorial

Introduction to Fuzzy Logic. IJCAI2018 Tutorial Introduction to Fuzzy Logic IJCAI2018 Tutorial 1 Crisp set vs. Fuzzy set A traditional crisp set A fuzzy set 2 Crisp set vs. Fuzzy set 3 Crisp Logic Example I Crisp logic is concerned with absolutes-true

More information

Disjunctive and Conjunctive Normal Forms in Fuzzy Logic

Disjunctive and Conjunctive Normal Forms in Fuzzy Logic Disjunctive and Conjunctive Normal Forms in Fuzzy Logic K. Maes, B. De Baets and J. Fodor 2 Department of Applied Mathematics, Biometrics and Process Control Ghent University, Coupure links 653, B-9 Gent,

More information

Computational Intelligence Lecture 10:Fuzzy Sets

Computational Intelligence Lecture 10:Fuzzy Sets Computational Intelligence Lecture 10:Fuzzy Sets Farzaneh Abdollahi Department of Electrical Engineering Amirkabir University of Technology Fall 2011 arzaneh Abdollahi Computational Intelligence Lecture

More information

CSC Discrete Math I, Spring Sets

CSC Discrete Math I, Spring Sets CSC 125 - Discrete Math I, Spring 2017 Sets Sets A set is well-defined, unordered collection of objects The objects in a set are called the elements, or members, of the set A set is said to contain its

More information

2.2 Set Operations. Introduction DEFINITION 1. EXAMPLE 1 The union of the sets {1, 3, 5} and {1, 2, 3} is the set {1, 2, 3, 5}; that is, EXAMPLE 2

2.2 Set Operations. Introduction DEFINITION 1. EXAMPLE 1 The union of the sets {1, 3, 5} and {1, 2, 3} is the set {1, 2, 3, 5}; that is, EXAMPLE 2 2.2 Set Operations 127 2.2 Set Operations Introduction Two, or more, sets can be combined in many different ways. For instance, starting with the set of mathematics majors at your school and the set of

More information

A Brief Idea on Fuzzy and Crisp Sets

A Brief Idea on Fuzzy and Crisp Sets International OPEN ACCESS Journal Of Modern Engineering Research (IJMER) A Brief Idea on Fuzzy and Crisp Sets Rednam SS Jyothi 1, Eswar Patnala 2, K.Asish Vardhan 3 (Asst.Prof(c),Information Technology,

More information

Discrete Mathematics Lecture 4. Harper Langston New York University

Discrete Mathematics Lecture 4. Harper Langston New York University Discrete Mathematics Lecture 4 Harper Langston New York University Sequences Sequence is a set of (usually infinite number of) ordered elements: a 1, a 2,, a n, Each individual element a k is called a

More information

GEOG 5113 Special Topics in GIScience. Why is Classical set theory restricted? Contradiction & Excluded Middle. Fuzzy Set Theory in GIScience

GEOG 5113 Special Topics in GIScience. Why is Classical set theory restricted? Contradiction & Excluded Middle. Fuzzy Set Theory in GIScience GEOG 5113 Special Topics in GIScience Fuzzy Set Theory in GIScience -Basic Properties and Concepts of Fuzzy Sets- Why is Classical set theory restricted? Boundaries of classical sets are required to be

More information

Fuzzy Sets and Systems. Lecture 2 (Fuzzy Sets) Bu- Ali Sina University Computer Engineering Dep. Spring 2010

Fuzzy Sets and Systems. Lecture 2 (Fuzzy Sets) Bu- Ali Sina University Computer Engineering Dep. Spring 2010 Fuzzy Sets and Systems Lecture 2 (Fuzzy Sets) Bu- Ali Sina University Computer Engineering Dep. Spring 2010 Fuzzy Sets Formal definition: A fuzzy set A in X (universal set) is expressed as a set of ordered

More information

TA: Jade Cheng ICS 241 Recitation Lecture Notes #12 November 13, 2009

TA: Jade Cheng ICS 241 Recitation Lecture Notes #12 November 13, 2009 TA: Jade Cheng ICS 241 Recitation Lecture Notes #12 November 13, 2009 Recitation #12 Question: Use Prim s algorithm to find a minimum spanning tree for the given weighted graph. Step 1. Start from the

More information

FUZZY SYSTEMS: Basics using MATLAB Fuzzy Toolbox. Heikki N. Koivo

FUZZY SYSTEMS: Basics using MATLAB Fuzzy Toolbox. Heikki N. Koivo FUZZY SYSTEMS: Basics using MATLAB Fuzzy Toolbox By Heikki N. Koivo 200 2.. Fuzzy sets Membership functions Fuzzy set Universal discourse U set of elements, {u}. Fuzzy set F in universal discourse U: Membership

More information

FUZZY SETS. Precision vs. Relevancy LOOK OUT! A 1500 Kg mass is approaching your head OUT!!

FUZZY SETS. Precision vs. Relevancy LOOK OUT! A 1500 Kg mass is approaching your head OUT!! FUZZY SETS Precision vs. Relevancy A 5 Kg mass is approaching your head at at 45.3 45.3 m/sec. m/s. OUT!! LOOK OUT! 4 Introduction How to simplify very complex systems? Allow some degree of uncertainty

More information

c) the set of students at your school who either are sophomores or are taking discrete mathematics

c) the set of students at your school who either are sophomores or are taking discrete mathematics Exercises Exercises Page 136 1. Let A be the set of students who live within one mile of school and let B be the set of students who walk to classes. Describe the students in each of these sets. a) A B

More information

Boolean Functions (10.1) Representing Boolean Functions (10.2) Logic Gates (10.3)

Boolean Functions (10.1) Representing Boolean Functions (10.2) Logic Gates (10.3) Chapter (Part ): Boolean Algebra Boolean Functions (.) Representing Boolean Functions (.2) Logic Gates (.3) It has started from the book titled The laws of thought written b George Boole in 854 Claude

More information

CS February 17

CS February 17 Discrete Mathematics CS 26 February 7 Equal Boolean Functions Two Boolean functions F and G of degree n are equal iff for all (x n,..x n ) B, F (x,..x n ) = G (x,..x n ) Example: F(x,y,z) = x(y+z), G(x,y,z)

More information

CS100: DISCRETE STRUCTURES

CS100: DISCRETE STRUCTURES CS: DISCRETE STRUCTURES Computer Science Department Lecture : Set and Sets Operations (Ch2) Lecture Contents 2 Sets Definition. Some Important Sets. Notation used to describe membership in sets. How to

More information

MATA GUJRI MAHILA MAHAVIDYALAYA (AUTO), JABALPUR DEPARTMENT OF MATHEMATICS M.Sc. (MATHEMATICS) THIRD SEMESTER

MATA GUJRI MAHILA MAHAVIDYALAYA (AUTO), JABALPUR DEPARTMENT OF MATHEMATICS M.Sc. (MATHEMATICS) THIRD SEMESTER MATA GUJRI MAHILA MAHAVIDYALAYA (AUTO), JABALPUR DEPARTMENT OF MATHEMATICS 2017-18 M.Sc. (MATHEMATICS) THIRD SEMESTER Name of the Papers Theory Min. C.C.E. Min. Practical Min. Total (MM) Pass. Pass. Pass

More information

The Extended Algebra. Duplicate Elimination. Sorting. Example: Duplicate Elimination

The Extended Algebra. Duplicate Elimination. Sorting. Example: Duplicate Elimination The Extended Algebra Duplicate Elimination 2 δ = eliminate duplicates from bags. τ = sort tuples. γ = grouping and aggregation. Outerjoin : avoids dangling tuples = tuples that do not join with anything.

More information

SYLLABUS. M.Sc. III rd SEMESTER Department of Mathematics Mata Gujri Mahila Mahavidyalaya,(Auto), Jabalpur

SYLLABUS. M.Sc. III rd SEMESTER Department of Mathematics Mata Gujri Mahila Mahavidyalaya,(Auto), Jabalpur SYLLABUS M.Sc. III rd SEMESTER 2018-19 Department of Mathematics Mata Gujri Mahila Mahavidyalaya,(Auto), Jabalpur MATA GUJRI MAHILA MAHAVIDYALAYA (AUTO), JABALPUR M.Sc. (MATHEMATICS) THIRD SEMESTER Name

More information

Unit V. Neural Fuzzy System

Unit V. Neural Fuzzy System Unit V Neural Fuzzy System 1 Fuzzy Set In the classical set, its characteristic function assigns a value of either 1 or 0 to each individual in the universal set, There by discriminating between members

More information

CHAPTER 3 FUZZY RELATION and COMPOSITION

CHAPTER 3 FUZZY RELATION and COMPOSITION CHAPTER 3 FUZZY RELATION and COMPOSITION Crisp relation! Definition (Product set) Let A and B be two non-empty sets, the prod uct set or Cartesian product A B is defined as follows, A B = {(a, b) a A,

More information

Sets and set operations

Sets and set operations CS 44 Discrete Mathematics for CS Lecture Sets and set operations Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Course administration Homework 3: Due today Homework 4: Due next week on Friday,

More information

Fuzzy Logic : Introduction

Fuzzy Logic : Introduction Fuzzy Logic : Introduction Debasis Samanta IIT Kharagpur dsamanta@iitkgp.ac.in 23.01.2018 Debasis Samanta (IIT Kharagpur) Soft Computing Applications 23.01.2018 1 / 69 What is Fuzzy logic? Fuzzy logic

More information

SINGLE VALUED NEUTROSOPHIC SETS

SINGLE VALUED NEUTROSOPHIC SETS Fuzzy Sets, Rough Sets and Multivalued Operations and pplications, Vol 3, No 1, (January-June 2011): 33 39; ISSN : 0974-9942 International Science Press SINGLE VLUED NEUTROSOPHIC SETS Haibin Wang, Yanqing

More information

1 of 7 7/15/2009 3:40 PM Virtual Laboratories > 1. Foundations > 1 2 3 4 5 6 7 8 9 1. Sets Poincaré's quote, on the title page of this chapter could not be more wrong (what was he thinking?). Set theory

More information

2.1 Sets 2.2 Set Operations

2.1 Sets 2.2 Set Operations CSC2510 Theoretical Foundations of Computer Science 2.1 Sets 2.2 Set Operations Introduction to Set Theory A set is a structure, representing an unordered collection (group, plurality) of zero or more

More information

FUZZY BOOLEAN ALGEBRAS AND LUKASIEWICZ LOGIC. Angel Garrido

FUZZY BOOLEAN ALGEBRAS AND LUKASIEWICZ LOGIC. Angel Garrido Acta Universitatis Apulensis ISSN: 1582-5329 No. 22/2010 pp. 101-111 FUZZY BOOLEAN ALGEBRAS AND LUKASIEWICZ LOGIC Angel Garrido Abstract. In this paper, we analyze the more adequate tools to solve many

More information

2 Review of Set Theory

2 Review of Set Theory 2 Review of Set Theory Example 2.1. Let Ω = {1, 2, 3, 4, 5, 6} 2.2. Venn diagram is very useful in set theory. It is often used to portray relationships between sets. Many identities can be read out simply

More information

Discrete Mathematics

Discrete Mathematics Discrete Mathematics Lecture 2: Basic Structures: Set Theory MING GAO DaSE@ ECNU (for course related communications) mgao@dase.ecnu.edu.cn Sep. 18, 2017 Outline 1 Set Concepts 2 Set Operations 3 Application

More information

REVIEW OF FUZZY SETS

REVIEW OF FUZZY SETS REVIEW OF FUZZY SETS CONNER HANSEN 1. Introduction L. A. Zadeh s paper Fuzzy Sets* [1] introduces the concept of a fuzzy set, provides definitions for various fuzzy set operations, and proves several properties

More information

Fuzzy Set, Fuzzy Logic, and its Applications

Fuzzy Set, Fuzzy Logic, and its Applications Sistem Cerdas (TE 4485) Fuzzy Set, Fuzzy Logic, and its pplications Instructor: Thiang Room: I.201 Phone: 031-2983115 Email: thiang@petra.ac.id Sistem Cerdas: Fuzzy Set and Fuzzy Logic - 1 Introduction

More information

Boolean Algebra. P1. The OR operation is closed for all x, y B x + y B

Boolean Algebra. P1. The OR operation is closed for all x, y B x + y B Boolean Algebra A Boolean Algebra is a mathematical system consisting of a set of elements B, two binary operations OR (+) and AND ( ), a unary operation NOT ('), an equality sign (=) to indicate equivalence

More information

Fuzzy Reasoning. Outline

Fuzzy Reasoning. Outline Fuzzy Reasoning Outline Introduction Bivalent & Multivalent Logics Fundamental fuzzy concepts Fuzzification Defuzzification Fuzzy Expert System Neuro-fuzzy System Introduction Fuzzy concept first introduced

More information

VHDL framework for modeling fuzzy automata

VHDL framework for modeling fuzzy automata Doru Todinca Daniel Butoianu Department of Computers Politehnica University of Timisoara SYNASC 2012 Outline Motivation 1 Motivation Why fuzzy automata? Why a framework for modeling FA? Why VHDL? 2 Fuzzy

More information

计算智能 第 10 讲 : 模糊集理论 周水庚 计算机科学技术学院

计算智能 第 10 讲 : 模糊集理论 周水庚 计算机科学技术学院 计算智能 第 0 讲 : 模糊集理论 周水庚 计算机科学技术学院 207-5-9 Introduction to Fuzzy Set Theory Outline Fuzzy Sets Set-Theoretic Operations MF Formulation Extension Principle Fuzzy Relations Linguistic Variables Fuzzy Rules

More information

Fuzzy Mathematics. Fuzzy -Sets, -Relations, -Logic, -Graphs, -Mappings and The Extension Principle. Olaf Wolkenhauer. Control Systems Centre UMIST

Fuzzy Mathematics. Fuzzy -Sets, -Relations, -Logic, -Graphs, -Mappings and The Extension Principle. Olaf Wolkenhauer. Control Systems Centre UMIST Fuzzy Mathematics Fuzzy -Sets, -Relations, -Logic, -Graphs, -Mappings and The Extension Principle Olaf Wolkenhauer Control Systems Centre UMIST o.wolkenhauer@umist.ac.uk www.csc.umist.ac.uk/people/wolkenhauer.htm

More information

Introduction to Boolean Algebra

Introduction to Boolean Algebra Introduction to Boolean Algebra Boolean algebra which deals with two-valued (true / false or and ) variables and functions find its use in modern digital computers since they too use two-level systems

More information

Introduction to Boolean Algebra

Introduction to Boolean Algebra Introduction to Boolean Algebra Boolean algebra which deals with two-valued (true / false or and ) variables and functions find its use in modern digital computers since they too use two-level systems

More information

24 Nov Boolean Operations. Boolean Algebra. Boolean Functions and Expressions. Boolean Functions and Expressions

24 Nov Boolean Operations. Boolean Algebra. Boolean Functions and Expressions. Boolean Functions and Expressions 24 Nov 25 Boolean Algebra Boolean algebra provides the operations and the rules for working with the set {, }. These are the rules that underlie electronic circuits, and the methods we will discuss are

More information

3. According to universal addressing, what is the address of vertex d? 4. According to universal addressing, what is the address of vertex f?

3. According to universal addressing, what is the address of vertex d? 4. According to universal addressing, what is the address of vertex f? 1. Prove: A full m-ary tree with i internal vertices contains n = mi + 1 vertices. 2. For a full m-ary tree with n vertices, i internal vertices, and l leaves, prove: (i) i = (n 1)/m and l = [(m 1)n +

More information

Fuzzy Soft Mathematical Morphology

Fuzzy Soft Mathematical Morphology Fuzzy Soft Mathematical Morphology. Gasteratos, I. ndreadis and Ph. Tsalides Laboratory of Electronics Section of Electronics and Information Systems Technology Department of Electrical and Computer Engineering

More information

UNIT 2 BOOLEAN ALGEBRA

UNIT 2 BOOLEAN ALGEBRA UNIT 2 BOOLEN LGEBR Spring 2 2 Contents Introduction Basic operations Boolean expressions and truth tables Theorems and laws Basic theorems Commutative, associative, and distributive laws Simplification

More information

1 Sets, Fields, and Events

1 Sets, Fields, and Events CHAPTER 1 Sets, Fields, and Events B 1.1 SET DEFINITIONS The concept of sets play an important role in probability. We will define a set in the following paragraph. Definition of Set A set is a collection

More information

Propositional Calculus: Boolean Algebra and Simplification. CS 270: Mathematical Foundations of Computer Science Jeremy Johnson

Propositional Calculus: Boolean Algebra and Simplification. CS 270: Mathematical Foundations of Computer Science Jeremy Johnson Propositional Calculus: Boolean Algebra and Simplification CS 270: Mathematical Foundations of Computer Science Jeremy Johnson Propositional Calculus Topics Motivation: Simplifying Conditional Expressions

More information

Fuzzy Systems. Fuzzy Systems in Knowledge Engineering. Chapter 4. Christian Jacob. 4. Fuzzy Systems. Fuzzy Systems in Knowledge Engineering

Fuzzy Systems. Fuzzy Systems in Knowledge Engineering. Chapter 4. Christian Jacob. 4. Fuzzy Systems. Fuzzy Systems in Knowledge Engineering Chapter 4 Fuzzy Systems Knowledge Engeerg Fuzzy Systems Christian Jacob jacob@cpsc.ucalgary.ca Department of Computer Science University of Calgary [Kasabov, 1996] Fuzzy Systems Knowledge Engeerg [Kasabov,

More information

2. Sets. 2.1&2.2: Sets and Subsets. Combining Sets. c Dr Oksana Shatalov, Fall

2. Sets. 2.1&2.2: Sets and Subsets. Combining Sets. c Dr Oksana Shatalov, Fall c Dr Oksana Shatalov, Fall 2014 1 2. Sets 2.1&2.2: Sets and Subsets. Combining Sets. Set Terminology and Notation DEFINITIONS: Set is well-defined collection of objects. Elements are objects or members

More information

1.1 - Introduction to Sets

1.1 - Introduction to Sets 1.1 - Introduction to Sets Math 166-502 Blake Boudreaux Department of Mathematics Texas A&M University January 18, 2018 Blake Boudreaux (Texas A&M University) 1.1 - Introduction to Sets January 18, 2018

More information

Sets. De Morgan s laws. Mappings. Definition. Definition

Sets. De Morgan s laws. Mappings. Definition. Definition Sets Let X and Y be two sets. Then the set A set is a collection of elements. Two sets are equal if they contain exactly the same elements. A is a subset of B (A B) if all the elements of A also belong

More information

Sets. Mukulika Ghosh. Fall Based on slides by Dr. Hyunyoung Lee

Sets. Mukulika Ghosh. Fall Based on slides by Dr. Hyunyoung Lee Sets Mukulika Ghosh Fall 2018 Based on slides by Dr. Hyunyoung Lee Sets Sets A set is an unordered collection of objects, called elements, without duplication. We write a A to denote that a is an element

More information

Fuzzy Sets and Systems. Lecture 1 (Introduction) Bu- Ali Sina University Computer Engineering Dep. Spring 2010

Fuzzy Sets and Systems. Lecture 1 (Introduction) Bu- Ali Sina University Computer Engineering Dep. Spring 2010 Fuzzy Sets and Systems Lecture 1 (Introduction) Bu- Ali Sina University Computer Engineering Dep. Spring 2010 Fuzzy sets and system Introduction and syllabus References Grading Fuzzy sets and system Syllabus

More information

Fuzzy logic. 1. Introduction. 2. Fuzzy sets. Radosªaw Warzocha. Wrocªaw, February 4, Denition Set operations

Fuzzy logic. 1. Introduction. 2. Fuzzy sets. Radosªaw Warzocha. Wrocªaw, February 4, Denition Set operations Fuzzy logic Radosªaw Warzocha Wrocªaw, February 4, 2014 1. Introduction A fuzzy concept appearing in works of many philosophers, eg. Hegel, Nietzche, Marx and Engels, is a concept the value of which can

More information

Chapter 2 Fuzzy Set Theory

Chapter 2 Fuzzy Set Theory Chapter 2 Fuzzy Set Theory This chapter aims to present the main concepts and mathematical notions of the fuzzy set theory (also called fuzzy logic or fuzzy logic theory ) which are necessary for the understanding

More information

Taibah University College of Computer Science & Engineering Course Title: Discrete Mathematics Code: CS 103. Chapter 2. Sets

Taibah University College of Computer Science & Engineering Course Title: Discrete Mathematics Code: CS 103. Chapter 2. Sets Taibah University College of Computer Science & Engineering Course Title: Discrete Mathematics Code: CS 103 Chapter 2 Sets Slides are adopted from Discrete Mathematics and It's Applications Kenneth H.

More information

Introduction to Intelligent Control Part 3

Introduction to Intelligent Control Part 3 ECE 4951 - Spring 2010 Introduction to Part 3 Prof. Marian S. Stachowicz Laboratory for Intelligent Systems ECE Department, University of Minnesota Duluth January 26-29, 2010 Part 1: Outline TYPES OF UNCERTAINTY

More information

Injntu.com Injntu.com Injntu.com R16

Injntu.com Injntu.com Injntu.com R16 1. a) What are the three methods of obtaining the 2 s complement of a given binary (3M) number? b) What do you mean by K-map? Name it advantages and disadvantages. (3M) c) Distinguish between a half-adder

More information

What is all the Fuzz about?

What is all the Fuzz about? What is all the Fuzz about? Fuzzy Systems CPSC 433 Christian Jacob Dept. of Computer Science Dept. of Biochemistry & Molecular Biology University of Calgary Fuzzy Systems in Knowledge Engineering Fuzzy

More information

Notation Index. Probability notation. (there exists) (such that) Fn-4 B n (Bell numbers) CL-27 s t (equivalence relation) GT-5.

Notation Index. Probability notation. (there exists) (such that) Fn-4 B n (Bell numbers) CL-27 s t (equivalence relation) GT-5. Notation Index (there exists) (for all) Fn-4 Fn-4 (such that) Fn-4 B n (Bell numbers) CL-27 s t (equivalence relation) GT-5 ( n ) k (binomial coefficient) CL-15 ( n m 1,m 2,...) (multinomial coefficient)

More information

ANFIS: ADAPTIVE-NETWORK-BASED FUZZY INFERENCE SYSTEMS (J.S.R. Jang 1993,1995) bell x; a, b, c = 1 a

ANFIS: ADAPTIVE-NETWORK-BASED FUZZY INFERENCE SYSTEMS (J.S.R. Jang 1993,1995) bell x; a, b, c = 1 a ANFIS: ADAPTIVE-NETWORK-ASED FUZZ INFERENCE SSTEMS (J.S.R. Jang 993,995) Membership Functions triangular triangle( ; a, a b, c c) ma min = b a, c b, 0, trapezoidal trapezoid( ; a, b, a c, d d) ma min =

More information

Unit-IV Boolean Algebra

Unit-IV Boolean Algebra Unit-IV Boolean Algebra Boolean Algebra Chapter: 08 Truth table: Truth table is a table, which represents all the possible values of logical variables/statements along with all the possible results of

More information

Walheer Barnabé. Topics in Mathematics Practical Session 2 - Topology & Convex

Walheer Barnabé. Topics in Mathematics Practical Session 2 - Topology & Convex Topics in Mathematics Practical Session 2 - Topology & Convex Sets Outline (i) Set membership and set operations (ii) Closed and open balls/sets (iii) Points (iv) Sets (v) Convex Sets Set Membership and

More information

Experiment 4 Boolean Functions Implementation

Experiment 4 Boolean Functions Implementation Experiment 4 Boolean Functions Implementation Introduction: Generally you will find that the basic logic functions AND, OR, NAND, NOR, and NOT are not sufficient to implement complex digital logic functions.

More information

A fuzzy constraint assigns every possible tuple in a relation a membership degree. The function

A fuzzy constraint assigns every possible tuple in a relation a membership degree. The function Scribe Notes: 2/13/2013 Presenter: Tony Schnider Scribe: Nate Stender Topic: Soft Constraints (Ch. 9 of CP handbook) Soft Constraints Motivation Soft constraints are used: 1. When we seek to find the best

More information

BOOLEAN ALGEBRA AND CIRCUITS

BOOLEAN ALGEBRA AND CIRCUITS UNIT 3 Structure BOOLEAN ALGEBRA AND CIRCUITS Boolean Algebra and 3. Introduction 3. Objectives 3.2 Boolean Algebras 3.3 Logic 3.4 Boolean Functions 3.5 Summary 3.6 Solutions/ Answers 3. INTRODUCTION This

More information

CSCI2467: Systems Programming Concepts

CSCI2467: Systems Programming Concepts CSCI2467: Systems Programming Concepts Slideset 2: Information as Data (CS:APP Chap. 2) Instructor: M. Toups Spring 2018 Course updates datalab out today! - due after Mardi gras... - do not wait until

More information

Dinner for Two, Reprise

Dinner for Two, Reprise Fuzzy Logic Toolbox Dinner for Two, Reprise In this section we provide the same two-input, one-output, three-rule tipping problem that you saw in the introduction, only in more detail. The basic structure

More information

Fuzzy Set-Theoretical Approach for Comparing Objects with Fuzzy Attributes

Fuzzy Set-Theoretical Approach for Comparing Objects with Fuzzy Attributes Fuzzy Set-Theoretical Approach for Comparing Objects with Fuzzy Attributes Y. Bashon, D. Neagu, M.J. Ridley Department of Computing University of Bradford Bradford, BD7 DP, UK e-mail: {Y.Bashon, D.Neagu,

More information

Lecture-12: Closed Sets

Lecture-12: Closed Sets and Its Examples Properties of Lecture-12: Dr. Department of Mathematics Lovely Professional University Punjab, India October 18, 2014 Outline Introduction and Its Examples Properties of 1 Introduction

More information

The set consisting of all natural numbers that are in A and are in B is the set f1; 3; 5g;

The set consisting of all natural numbers that are in A and are in B is the set f1; 3; 5g; Chapter 5 Set Theory 5.1 Sets and Operations on Sets Preview Activity 1 (Set Operations) Before beginning this section, it would be a good idea to review sets and set notation, including the roster method

More information

Review of Sets. Review. Philippe B. Laval. Current Semester. Kennesaw State University. Philippe B. Laval (KSU) Sets Current Semester 1 / 16

Review of Sets. Review. Philippe B. Laval. Current Semester. Kennesaw State University. Philippe B. Laval (KSU) Sets Current Semester 1 / 16 Review of Sets Review Philippe B. Laval Kennesaw State University Current Semester Philippe B. Laval (KSU) Sets Current Semester 1 / 16 Outline 1 Introduction 2 Definitions, Notations and Examples 3 Special

More information

Information Granulation and Approximation in a Decision-theoretic Model of Rough Sets

Information Granulation and Approximation in a Decision-theoretic Model of Rough Sets Information Granulation and Approximation in a Decision-theoretic Model of Rough Sets Y.Y. Yao Department of Computer Science University of Regina Regina, Saskatchewan Canada S4S 0A2 E-mail: yyao@cs.uregina.ca

More information

Set and Set Operations

Set and Set Operations Set and Set Operations Introduction A set is a collection of objects. The objects in a set are called elements of the set. A well defined set is a set in which we know for sure if an element belongs to

More information

COUNTING AND PROBABILITY

COUNTING AND PROBABILITY CHAPTER 9 COUNTING AND PROBABILITY Copyright Cengage Learning. All rights reserved. SECTION 9.3 Counting Elements of Disjoint Sets: The Addition Rule Copyright Cengage Learning. All rights reserved. Counting

More information

Fuzzy Logic: Human-like decision making

Fuzzy Logic: Human-like decision making Lecture 9 of Artificial Intelligence Fuzzy Logic: Human-like decision making AI Lec09/1 Topics of this lecture Definition of fuzzy set Membership function Notation of fuzzy set Operations of fuzzy set

More information

Machine Learning & Statistical Models

Machine Learning & Statistical Models Astroinformatics Machine Learning & Statistical Models Neural Networks Feed Forward Hybrid Decision Analysis Decision Trees Random Decision Forests Evolving Trees Minimum Spanning Trees Perceptron Multi

More information

Relational Algebra. B term 2004: lecture 10, 11

Relational Algebra. B term 2004: lecture 10, 11 Relational lgebra term 00: lecture 0, Nov, 00 asics Relational lgebra is defined on bags, rather than relations. ag or multiset allows duplicate values; but order is not significant. We can write an expression

More information

Lecture 5: Properties of convex sets

Lecture 5: Properties of convex sets Lecture 5: Properties of convex sets Rajat Mittal IIT Kanpur This week we will see properties of convex sets. These properties make convex sets special and are the reason why convex optimization problems

More information

Variable, Complement, and Literal are terms used in Boolean Algebra.

Variable, Complement, and Literal are terms used in Boolean Algebra. We have met gate logic and combination of gates. Another way of representing gate logic is through Boolean algebra, a way of algebraically representing logic gates. You should have already covered the

More information

Semantics of Fuzzy Sets in Rough Set Theory

Semantics of Fuzzy Sets in Rough Set Theory Semantics of Fuzzy Sets in Rough Set Theory Y.Y. Yao Department of Computer Science University of Regina Regina, Saskatchewan Canada S4S 0A2 E-mail: yyao@cs.uregina.ca URL: http://www.cs.uregina.ca/ yyao

More information

Computer Organization and Programming

Computer Organization and Programming Sep 2006 Prof. Antônio Augusto Fröhlich (http://www.lisha.ufsc.br) 8 Computer Organization and Programming Prof. Dr. Antônio Augusto Fröhlich guto@lisha.ufsc.br http://www.lisha.ufsc.br/~guto Sep 2006

More information

Unsupervised Learning. Presenter: Anil Sharma, PhD Scholar, IIIT-Delhi

Unsupervised Learning. Presenter: Anil Sharma, PhD Scholar, IIIT-Delhi Unsupervised Learning Presenter: Anil Sharma, PhD Scholar, IIIT-Delhi Content Motivation Introduction Applications Types of clustering Clustering criterion functions Distance functions Normalization Which

More information

CHAPTER 3 FUZZY RELATION and COMPOSITION

CHAPTER 3 FUZZY RELATION and COMPOSITION CHAPTER 3 FUZZY RELATION and COMPOSITION The concept of fuzzy set as a generalization of crisp set has been introduced in the previous chapter. Relations between elements of crisp sets can be extended

More information

Intro to Linear Programming. The problem that we desire to address in this course is loosely stated below.

Intro to Linear Programming. The problem that we desire to address in this course is loosely stated below. . Introduction Intro to Linear Programming The problem that we desire to address in this course is loosely stated below. Given a number of generators make price-quantity offers to sell (each provides their

More information

SYNERGY INSTITUTE OF ENGINEERING & TECHNOLOGY,DHENKANAL LECTURE NOTES ON DIGITAL ELECTRONICS CIRCUIT(SUBJECT CODE:PCEC4202)

SYNERGY INSTITUTE OF ENGINEERING & TECHNOLOGY,DHENKANAL LECTURE NOTES ON DIGITAL ELECTRONICS CIRCUIT(SUBJECT CODE:PCEC4202) Lecture No:5 Boolean Expressions and Definitions Boolean Algebra Boolean Algebra is used to analyze and simplify the digital (logic) circuits. It uses only the binary numbers i.e. 0 and 1. It is also called

More information

11 Sets II Operations

11 Sets II Operations 11 Sets II Operations Tom Lewis Fall Term 2010 Tom Lewis () 11 Sets II Operations Fall Term 2010 1 / 12 Outline 1 Union and intersection 2 Set operations 3 The size of a union 4 Difference and symmetric

More information

ENGIN 112 Intro to Electrical and Computer Engineering

ENGIN 112 Intro to Electrical and Computer Engineering ENGIN 2 Intro to Electrical and Computer Engineering Lecture 5 Boolean Algebra Overview Logic functions with s and s Building digital circuitry Truth tables Logic symbols and waveforms Boolean algebra

More information

Outline. CISC 1100/1400 Structures of Comp. Sci./Discrete Structures Chapter 1 Sets. Sets. Enumerating the elements of a set

Outline. CISC 1100/1400 Structures of Comp. Sci./Discrete Structures Chapter 1 Sets. Sets. Enumerating the elements of a set Outline CISC 1100/1400 Structures of Comp. Sci./Discrete Structures Chapter 1 Sets rthur G. Werschulz Fordham University Department of Computer and Information Sciences Copyright rthur G. Werschulz, 2017.

More information

Logic Design: Part 2

Logic Design: Part 2 Orange Coast College Business Division Computer Science Department CS 6- Computer Architecture Logic Design: Part 2 Where are we? Number systems Decimal Binary (and related Octal and Hexadecimal) Binary

More information

Logic and Proof course Solutions to exercises from chapter 6

Logic and Proof course Solutions to exercises from chapter 6 Logic and roof course Solutions to exercises from chapter 6 Fairouz Kamareddine 6.1 (a) We prove it as follows: Assume == Q and Q == R and R == S then by Transitivity of == R and R == S. Again, by Transitivity

More information

Finite Math - J-term Homework. Section Inverse of a Square Matrix

Finite Math - J-term Homework. Section Inverse of a Square Matrix Section.5-77, 78, 79, 80 Finite Math - J-term 017 Lecture Notes - 1/19/017 Homework Section.6-9, 1, 1, 15, 17, 18, 1, 6, 9, 3, 37, 39, 1,, 5, 6, 55 Section 5.1-9, 11, 1, 13, 1, 17, 9, 30 Section.5 - Inverse

More information

ROUGH MEMBERSHIP FUNCTIONS: A TOOL FOR REASONING WITH UNCERTAINTY

ROUGH MEMBERSHIP FUNCTIONS: A TOOL FOR REASONING WITH UNCERTAINTY ALGEBRAIC METHODS IN LOGIC AND IN COMPUTER SCIENCE BANACH CENTER PUBLICATIONS, VOLUME 28 INSTITUTE OF MATHEMATICS POLISH ACADEMY OF SCIENCES WARSZAWA 1993 ROUGH MEMBERSHIP FUNCTIONS: A TOOL FOR REASONING

More information

1. Fuzzy sets, fuzzy relational calculus, linguistic approximation

1. Fuzzy sets, fuzzy relational calculus, linguistic approximation 1. Fuzzy sets, fuzzy relational calculus, linguistic approximation 1.1. Fuzzy sets Let us consider a classical set U (Universum) and a real function : U --- L. As a fuzzy set A we understand a set of pairs

More information

X : U -> [0, 1] R : U x V -> [0, 1]

X : U -> [0, 1] R : U x V -> [0, 1] A Fuzzy Logic 2000 educational package for Mathematica Marian S. Stachowicz and Lance Beall Electrical and Computer Engineering University of Minnesota Duluth, Minnesota 55812-2496, USA http://www.d.umn.edu/ece/lis

More information

γ 2 γ 3 γ 1 R 2 (b) a bounded Yin set (a) an unbounded Yin set

γ 2 γ 3 γ 1 R 2 (b) a bounded Yin set (a) an unbounded Yin set γ 1 γ 3 γ γ 3 γ γ 1 R (a) an unbounded Yin set (b) a bounded Yin set Fig..1: Jordan curve representation of a connected Yin set M R. A shaded region represents M and the dashed curves its boundary M that

More information

Adding Term Weight into Boolean Query and Ranking Facility to Improve the Boolean Retrieval Model

Adding Term Weight into Boolean Query and Ranking Facility to Improve the Boolean Retrieval Model Adding Term Weight into Boolean Query and Ranking Facility to Improve the Boolean Retrieval Model Jiayi Wu University of Windsor There are two major shortcomings of the Boolean Retrieval Model that has

More information

On Appropriate Selection of Fuzzy Aggregation Operators in Medical Decision Support System

On Appropriate Selection of Fuzzy Aggregation Operators in Medical Decision Support System On Appropriate Selection of Fuzzy s in Medical Decision Support System K.M. Motahar Hossain, Zahir Raihan, M.M.A. Hashem Department of Computer Science and Engineering, Khulna University of Engineering

More information

Review of Fuzzy Logical Database Models

Review of Fuzzy Logical Database Models IOSR Journal of Computer Engineering (IOSRJCE) ISSN: 2278-0661, ISBN: 2278-8727Volume 8, Issue 4 (Jan. - Feb. 2013), PP 24-30 Review of Fuzzy Logical Database Models Anupriya 1, Prof. Rahul Rishi 2 1 (Department

More information