IEEE Intelligent Systems ‘2010, London, UK On Intuitionistic Fuzzy Negations and Law of Excluded Middle Krassimir T. Atanassov Centre of Biophysics and.

Slides:



Advertisements
Similar presentations
Artificial Intelligence
Advertisements

Introduction The concept of transform appears often in the literature of image processing and data compression. Indeed a suitable discrete representation.
Intuitionistic fuzzy histograms Krassimir Atanassov Institute of Biophysics and Biomedical Engineering Bulgarian Academy of Sciences 6 th International.
CS128 – Discrete Mathematics for Computer Science
Formal Logic Proof Methods Direct Proof / Natural Deduction Conditional Proof (Implication Introduction) Reductio ad Absurdum Resolution Refutation.
1 Inference Rules and Proofs Z: Inference Rules and Proofs.
Many Valued Logic (MVL) By: Shay Erov - 01/11/2007.
Knoweldge Representation & Reasoning
WELCOME TO THE WORLD OF FUZZY SYSTEMS. DEFINITION Fuzzy logic is a superset of conventional (Boolean) logic that has been extended to handle the concept.
New Approach to Quantum Calculation of Spectral Coefficients Marek Perkowski Department of Electrical Engineering, 2005.
Adapted from Discrete Math
Fuzzy Logic Jan Jantzen Logic is based on set theory, and when we switch to fuzzy sets it will have an effect on.
Tautology. Tautology Decision May be able to use unateness to simplify process Unate Function – one that has either the uncomplemented or complemented.
Boolean Algebra Computer Organization 1 © McQuain Boolean Algebra A Boolean algebra is a set B of values together with: -two binary operations,
7 th International Conference on Numerical Methods and Applications, August 20-24, 2010, Borovets, Bulgaria Intuitionistic Fuzzy Interpretations of Conway's.
Copyright © Curt Hill Truth Tables A way to show Boolean Operations.
1 Inference Rules and Proofs (Z); Program Specification and Verification Inference Rules and Proofs (Z); Program Specification and Verification.
10/17/2015 Prepared by Dr.Saad Alabbad1 CS100 : Discrete Structures Proof Techniques(1) Dr.Saad Alabbad Department of Computer Science
Boolean Algebra and Computer Logic Mathematical Structures for Computer Science Chapter 7.1 – 7.2 Copyright © 2006 W.H. Freeman & Co.MSCS Slides Boolean.
Pattern-directed inference systems
       On a Game Method for M  delling with Intuitionistic Fuzzy Estimations. Part 2 Lilija Atanassova Institute of Information and Communication.
2.3Logical Implication: Rules of Inference From the notion of a valid argument, we begin a formal study of what we shall mean by an argument and when such.
0 What logic is or should be Propositions Boolean operations The language of classical propositional logic Interpretation and truth Validity (tautologicity)
Propositional Calculus CS 270: Mathematical Foundations of Computer Science Jeremy Johnson.
       On a Game Method for M  delling with Intuitionistic Fuzzy Estimations. Part 1 Lilija Atanassova Institute of Information and Communication.
Theory and Applications
7 th International Conference on Numerical Methods and Applications, August 20-24, 2010, Borovets, Bulgaria Ant Colony Optimization Approach to Tokens‘
Thinking Mathematically
CS6133 Software Specification and Verification
Chapter 2 Logic 2.1 Statements 2.2 The Negation of a Statement 2.3 The Disjunction and Conjunction of Statements 2.4 The Implication 2.5 More on Implications.
Section 3.4 Boolean Algebra. A link between:  Section 1.3: Logic Systems  Section 3.3: Set Systems Application:  Section 3.5: Logic Circuits in Computer.
Logic UNIT 1.
CS2351 Artificial Intelligence Bhaskar.V Class Notes on Knowledge Representation - Logical Agents.
LOGIC. Logic in general  Logics are formal languages for representing information such that conclusions can be drawn  Syntax defines the sentences in.
We will now study some special kinds of non-standard quantifiers. Definition 4. Let  (x),  (x) be two fixed formulae of a language L n such that x is.
CSE-321 Programming Languages Curry-Howard Isomorphism POSTECH June 4, 2009 박성우.
1 Section 6.2 Propositional Calculus Propositional calculus is the language of propositions (statements that are true or false). We represent propositions.
2004/9/15fuzzy set theory chap02.ppt1 Classical Logic the forms of correct reasoning - formal logic.
Foundations of Discrete Mathematics Chapter 1 By Dr. Dalia M. Gil, Ph.D.
March 3, 2016Introduction to Artificial Intelligence Lecture 12: Knowledge Representation & Reasoning I 1 Back to “Serious” Topics… Knowledge Representation.
Chapter 1 Logic and proofs
 Conjunctive Normal Form: A logic form must satisfy one of the following conditions 1) It must be a single variable (A) 2) It must be the negation of.
Propositional Logic (a.k.a. Sentential Logic)
Logic.
Chapter 7. Propositional and Predicate Logic
2. The Logic of Compound Statements Summary
Chapter 8 : Fuzzy Logic.
Knowledge Representation and Reasoning
Discrete Mathematics Logic.
Thinking Mathematically
COMP 1380 Discrete Structures I Thompson Rivers University
Classwork/Homework Classwork – Page 90 (11 – 49 odd)
Proof Techniques.
Disjunctive Normal Form
Propositional Calculus: Boolean Functions and Expressions
Propositional Calculus: Boolean Algebra and Simplification
Elementary Metamathematics
CS201: Data Structures and Discrete Mathematics I
Back to “Serious” Topics…
Discrete Mathematics and Its Applications Kenneth H
Computer Security: Art and Science, 2nd Edition
Lecture 2: Propositional Equivalences
Discrete Mathematics Logic.
Classical propositional logic (quick review)
Chapter 7. Propositional and Predicate Logic
Statements of Symbolic Logic
TRUTH TABLES.
Foundations of Discrete Mathematics
COMP 1380 Discrete Structures I Thompson Rivers University
CS201: Data Structures and Discrete Mathematics I
Presentation transcript:

IEEE Intelligent Systems ‘2010, London, UK On Intuitionistic Fuzzy Negations and Law of Excluded Middle Krassimir T. Atanassov Centre of Biophysics and Biomedical Engineering (Centre of Biomedical Engineering) Bulgarian Academy of Sciences

IEEE Intelligent Systems ‘2010, London, UK Introduction Let x be a variable. Then its intuitionistic fuzzy truth-value is represented by the ordered couple V (x) = so that a, b, a + b  [0; 1] where a and b are degrees of validity and of non- validity of x. Obviously, when V is an ordinary fuzzy truth-value estimation, for it b = 1 – a 1/20

IEEE Intelligent Systems ‘2010, London, UK Introduction Everywhere below, we shall assume that for the three variables x; y and z equalities hold: V (x) = V (y) = V (z) = where a, b, c, d, e, f, a + b, c + d, e + f  [0; 1]. For the needs of the discussion below, we shall define the notion of Intuitionistic Fuzzy Tautology (IFT) by: x is an IFT, if and only if a  b, while x will be a tautology iff a = 1 and b = 0.

IEEE Intelligent Systems ‘2010, London, UK Introduction In some definitions we shall use the functions sg and sg:

IEEE Intelligent Systems ‘2010, London, UK Introduction In ordinary intuitionistic fuzzy logic, the negation of variable x is N(x) such that V (N(x)) = For two variables x and y, operations conjunction (&) and disjunction (  ) are defined by: V(x & y) = V(x) & V(y) = V(x  y) = V(x)  V(y) =

IEEE Intelligent Systems ‘2010, London, UK List of IF implications

IEEE Intelligent Systems ‘2010, London, UK List of IF implications

IEEE Intelligent Systems ‘2010, London, UK List of respective IF negations

IEEE Intelligent Systems ‘2010, London, UK List of respective IF negations

IEEE Intelligent Systems ‘2010, London, UK List of respective IF negations

IEEE Intelligent Systems ‘2010, London, UK List of respective IF negations

IEEE Intelligent Systems ‘2010, London, UK Modified Law of excluded middle First, we shall give the LEM in the forms:  = (tautology-form) and  = (IFT-form) where 1  p  q  0 and p + q  1. Second, we shall give the Modified Law of Excluded Middle (MLEM) in the forms:   = (tautology-form) and   = (IFT-form) where 1  p  q  0 and p + q  1.

IEEE Intelligent Systems ‘2010, London, UK Theorems Theorem #1: Only negation  13 satisfies the LEM in the tautological form. Theorem #2: Only negations  2,  5,  9,  11,  13,  16 satisfy the MLEM in the tautological form. Theorem #3: Only negations  2,  5,  6,  10 do not satisfy the LEM in the IFT form. Theorem #4: Only negation  10, does not satisfy the MLEM in the IFT form.

IEEE Intelligent Systems ‘2010, London, UK Now, on the following table, we will show the behaviour of the separate negations with respect to the special constants: V (true) = V (false) = V (full uncertainty) =

IEEE Intelligent Systems ‘2010, London, UK

The above assertions show that a lot of negations exhibit behaviour that is typical of the intuitionistic logic, but not of the classical logic. Now, let us return from the intuitionistic fuzzy negations to ordinary fuzzy negations. The result is shown on the following table, where b = 1.

IEEE Intelligent Systems ‘2010, London, UK Therefore, from the list of intuitionistic fuzzy negations we can generate a list of fuzzy negations, such that some of them coincide with the standard fuzzy negation  1.

IEEE Intelligent Systems ‘2010, London, UK Conclusion Therefore, there are intuitionistic fuzzy negations that lose their properties when they are restricted to ordinary fuzzy case. In other words, the construction of the intuitionistic fuzzy estimation <degree of membership/validity, degree of non-membership/non-validity> that is specific for the intuitionistic fuzzy sets, causes the intuitionistic behaviour of these sets.

IEEE Intelligent Systems ‘2010, London, UK Conclusion Finally, we must note that in the IFS theory there have already been defined some other types of intuitionistic fuzzy negations different from the discussed above. Their behaviour will be studied in a next author's research.

IEEE Intelligent Systems ‘2010, London, UK Thank you for your attention! Krassimir T. Atanassov Centre of Biophysics and Biomedical Engineering (Centre of Biomedical Engineering) Bulgarian Academy of Sciences