Comparison of 3-valued Logic using Fuzzy Rules

Similar documents
Rule-Based Fuzzy Model

On flexible database querying via extensions to fuzzy sets

Efficient Approximate Reasoning with Positive and Negative Information

A New Perspective on Reasoning with Fuzzy Rules

Section 1.2 Propositional Equivalences. A tautology is a proposition which is always true. A contradiction is a proposition which is always false.

Tautologies, Contradictions, and Contingencies

Chapter 4: Classical Propositional Semantics

A Formal Logical Framework for Cadiag-2

CSC Discrete Math I, Spring Propositional Logic

Laurent UGHETTO Λ, Didier DUBOIS ΛΛ and Henri PRADE ΛΛ

Uncertain Logic with Multiple Predicates

Pei Wang( 王培 ) Temple University, Philadelphia, USA

On Warranted Inference in Possibilistic Defeasible Logic Programming 1

A statement is a sentence that is definitely either true or false but not both.

Propositional Logic. Yimei Xiang 11 February format strictly follow the laws and never skip any step.

Fuzzy Logic. By Clifton F. Cobb

CHAPTER 10. Gentzen Style Proof Systems for Classical Logic

Fuzzy Systems. Introduction

Encoding formulas with partially constrained weights in a possibilistic-like many-sorted propositional logic

Fuzzy Systems. Introduction

Conflict-Based Belief Revision Operators in Possibilistic Logic

Section 1.2: Propositional Logic

We last time we began introducing equivalency laws.

2.2: Logical Equivalence: The Laws of Logic

LING 106. Knowledge of Meaning Lecture 3-1 Yimei Xiang Feb 6, Propositional logic

Fuzzy Systems. Possibility Theory

GENERAL AGGREGATION OPERATORS ACTING ON FUZZY NUMBERS INDUCED BY ORDINARY AGGREGATION OPERATORS

Introducing Interpolative Boolean algebra into Intuitionistic

2. The Logic of Compound Statements Summary. Aaron Tan August 2017

Partial Implication Semantics for Desirable Propositions

Vague and Uncertain Entailment: Some Conceptual Clarifications

Aggregation and Non-Contradiction

A Fuzzy Formal Logic for Interval-valued Residuated Lattices

Propositional Logic: Logical Agents (Part I)

Where are we? Operations on fuzzy sets (cont.) Fuzzy Logic. Motivation. Crisp and fuzzy sets. Examples

Left-continuous t-norms in Fuzzy Logic: an Overview

A Strong Relevant Logic Model of Epistemic Processes in Scientific Discovery

CSE 311: Foundations of Computing. Lecture 2: More Logic, Equivalence & Digital Circuits

Propositional Logic: Logical Agents (Part I)

Possibilistic Logic. Damien Peelman, Antoine Coulon, Amadou Sylla, Antoine Dessaigne, Loïc Cerf, Narges Hadji-Hosseini.

Topic 1: Propositional logic

THE LOGIC OF OPINION

Knowledge base (KB) = set of sentences in a formal language Declarative approach to building an agent (or other system):

Logic and Discrete Mathematics. Section 3.5 Propositional logical equivalence Negation of propositional formulae

Interval based Uncertain Reasoning using Fuzzy and Rough Sets

COMP219: Artificial Intelligence. Lecture 19: Logic for KR

Methods of Partial Logic for Knowledge Representation and Deductive Reasoning in Incompletely Specified Domains

Propositional Logic: Equivalence

Argument-based Expansion Operators in Possibilistic Defeasible Logic Programming: Characterization and Logical Properties

COMP219: Artificial Intelligence. Lecture 19: Logic for KR

Measuring conflict and agreement between two prioritized belief bases

Consistency checking for extended description logics

Chapter Summary. Propositional Logic. Predicate Logic. Proofs. The Language of Propositions (1.1) Applications (1.2) Logical Equivalences (1.

Math Real Analysis

Towards Smooth Monotonicity in Fuzzy Inference System based on Gradual Generalized Modus Ponens

Fuzzy Logic in Narrow Sense with Hedges

Propositional Logic. Logical Expressions. Logic Minimization. CNF and DNF. Algebraic Laws for Logical Expressions CSC 173

Concept lattices in fuzzy relation equations

On analysis of the unicity of Jeffrey s rule of conditioning in a possibilistic framework

Mining Positive and Negative Fuzzy Association Rules

Inference Methods In Propositional Logic

Lecture 2. Logic Compound Statements Conditional Statements Valid & Invalid Arguments Digital Logic Circuits. Reading (Epp s textbook)

Introduction to fuzzy logic

Agenda. Artificial Intelligence. Reasoning in the Wumpus World. The Wumpus World

The Limitation of Bayesianism

Knowledge representation DATA INFORMATION KNOWLEDGE WISDOM. Figure Relation ship between data, information knowledge and wisdom.

USING POSSIBILITY THEORY IN EXPERT SYSTEMS ABSTRACT

Numbers that are divisible by 2 are even. The above statement could also be written in other logically equivalent ways, such as:

CRITICALITY ASSESSMENT RISK; CONTRIBUTION OF FUZZY LOGIC

Propositional Logic: Methods of Proof (Part II)

Tableaux, Abduction and Truthlikeness RESEARCH REPORT

Kamila BENDOVÁ INTERPOLATION AND THREE-VALUED LOGICS

Comparison of Rough-set and Interval-set Models for Uncertain Reasoning

n logical not (negation) n logical or (disjunction) n logical and (conjunction) n logical exclusive or n logical implication (conditional)

CS 7180: Behavioral Modeling and Decision- making in AI

International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems c World Scientific Publishing Company

Fuzzy Logic and Computing with Words. Ning Xiong. School of Innovation, Design, and Engineering Mälardalen University. Motivations

CSE20: Discrete Mathematics for Computer Science. Lecture Unit 2: Boolan Functions, Logic Circuits, and Implication

HW1 graded review form? HW2 released CSE 20 DISCRETE MATH. Fall

Intelligent Agents. First Order Logic. Ute Schmid. Cognitive Systems, Applied Computer Science, Bamberg University. last change: 19.

Fuzzy and Rough Sets Part I

CISC-102 Fall 2018 Week 11

Overview. I Review of natural deduction. I Soundness and completeness. I Semantics of propositional formulas. I Soundness proof. I Completeness proof.

Possibilistic Networks: Data Mining Applications

A Split-combination Method for Merging Inconsistent Possibilistic Knowledge Bases

A Powerful way to analyze and control a complex system

AI Principles, Semester 2, Week 2, Lecture 5 Propositional Logic and Predicate Logic

Compound Propositions

Index Terms Vague Logic, Linguistic Variable, Approximate Reasoning (AR), GMP and GMT

2 WANG Jue, CUI Jia et al. Vol.16 no", the discernibility matrix is only a new kind of learning method. Otherwise, we have to provide the specificatio

A Class of Star-Algebras for Point-Based Qualitative Reasoning in Two- Dimensional Space

Uncertain Satisfiability and Uncertain Entailment

On the Intersections of QL-Implications with (S, N)- and R-Implications

MAT2345 Discrete Math

Inference Methods In Propositional Logic

Propositional Logic: Models and Proofs

Uncertainty in Heuristic Knowledge and Reasoning

Mathematics for linguists

Teaching Natural Deduction as a Subversive Activity

So, we can say that fuzzy proposition is a statement p which acquires a fuzzy truth value T(p) ranges from(0 to1).

Transcription:

International Journal of Scientific and Research Publications, Volume 3, Issue 8, August 2013 1 Comparison of 3-valued Logic using Fuzzy Rules Dr. G.Nirmala* and G.Suvitha** *Associate Professor, P.G & Research Department of Mathematics, K.N.G Arts College for Women (Autonomous), Thanjavur- 613007, Tamil Nadu, India. Email Id: nirmalamanohar11@yahoo.com **Assistant Professor, Department of Mathematics (science & Humanities), Sri Sai Ram Institute of Technology, West Tambaram, Chennai-600044, Tamil Nadu, India. Email Id: Suvitha_g@yahoo.co.in Abstract: The information encoded on a computer may have a negative or a positive emphasis. Negative information refers to the statement that some situations are impossible. It is often the case for pieces of background knowledge expressed in a logical format. Positive information refers to observed cases. It is often encountered in data-driven mathematical models, learning, etc. The notion of an if..., then... rule is examined in the context of positive and negative information. We know that the classical logic is two valued TRUE and FALSE. In real life situations the true valued logic can be seen inadequate. We need logics which will allow the other truth values in between TRUE and FALSE. This paper gives an idea of the logic that needs to be put forward beyond classical two valued logic. Index Terms Fuzzy rule, antecedent, consequent, fuzzy implications. 1. INTRODUCTION Fuzzy rules are often considered to be a basic concept in fuzzy logic [1]. Fuzzy rules were meant to represent human knowledge in the design of control systems, when mathematical models were lacking [2]. Topics like data mining, knowledge discovery and various forms of learning techniques have become an important challenge in information technology, due to the huge amount of data stored in information systems. Looking for meaning in data has become again a relevant issue. Even though the classical two-valued logic codifies and explains the human reasoning, it has been felt that it does not reflect whole gamut of our reasoning capabilities. This leads to the three-valued representation of a rule, according to which a given state of the world is an example of the rule, a counterexample to the rule, or is irrelevant for the rule. This view also sheds light on the typology of fuzzy rules. It explains the difference between a fuzzy rule modeled by a many-valued implication, and expressing negative information, and a fuzzy rule modeled by a conjunction and expressing positive information. The aim of this paper is: 1. to give a 3-valued logical account of Bochvar s and Heyting s Fuzzy. 2. to show that the typology of fuzzy rules, previously proposed by the authors [18,19] manages to reconcile the knowledge-driven logical tradition and data-driven engineering tradition; 2. PRELIMINARIES Definition 2.1: Fuzzy Rule A fuzzy rule is of the form: R: If < x is P > then < y is Q > where x is P and y is Q are fuzzy propositions. The meaning of x is P, is called the rule antecedent and the meaning of y is Q, is called the rule consequent. Examples: 1. If < temperature is high > then < pressure will be low > 2. If < a tomato is red > then < it is ripe >

International Journal of Scientific and Research Publications, Volume 3, Issue 8, August 2013 2 Figure 1: Partition on U x V induced by the rule If x is P, then y is Q Definition2.2. Negative view: The rule is viewed as a constraint of the form if x is P, then y must be Q. In other words, if x p and y Q then (x,y) R, or equivalently R P Q. This view emphasizes only the counter-examples to the rule. It is the implicative form of the rule. Pairs of attribute values in P Q are deemed impossible. Other ones remain possible, as shown on Fig Figure 2: Negative view of the rule If x is P, then y is Q Definition2.3. Positive view: The rule is viewed as a case of the form if x is P, then y can be Q. In other words, if x p and y Q then (x,y) R, or equivalently P Q R. This view emphasizes only the examples to the rule. It is the conjunctive form of the rule. Pairs of attribute values in P Q are guaranteed possible. It is not known as other ones are possible or not, as shown on figure.

International Journal of Scientific and Research Publications, Volume 3, Issue 8, August 2013 3 3: Three-valued Logic & IF-THEN rules Figure 3: Positive view of the rule If x is P, then y is Q (a) The 3- valued logic is same as in 2- valued logic, except that there are truth values: True, May be and False. These linguistic values are represented by 1, ½ and 0. In this 3- valued logic, denoted by L3, the truth value of any statement can be either 1 or ½ or 0. i.e. T(p) = 1 or ½ or 0. We define these 3 operations on the statements p, q, r,... denoted by p q, p q and p analogous to the three operations OR, AND and NOT of classical logic. These are defined by their truth values as follows: T(p q) = max {T(p), T(q)} T(p q) = min {T(p), T(q)} T( p) = 1 T(p) (b) Lukasiewicz, also defined the implication operator by T(p q) = 1 T(p) + T(q) if T(p) > T(q) = 1 if T(p) T(q) Or simply as (p q) = min{1, 1 T(p) + T(q)} Using this formula we derive the truth table of. Table I 1 1/2 0 1 1 1/2 0 1/2 1 1 1/2 0 1 1 1 Here the four corner values are same as the condition operator of the classical logic.

International Journal of Scientific and Research Publications, Volume 3, Issue 8, August 2013 4 (c) Similarly, we can frame the truth tables of the other three operations. This 3- valued logic has many distinguishing and surprising features. One of them is that WFF [p ( p)] is NOT a tautology. This is given in the below Table 2. Table II p p p ( p) 1 0 1 1/2 1/2 1/2 0 1 1 Here we see that the last column does not have all entries equal to 1. The above generalization of the classical logic by Lukasiewicz inspired many other generalizations. 4. COMPARISION OF BOCHVAR S & HEYTINGS S 3-VALUED LOGIC Here we have compared the Bochvar s and Heyting s values in3- valued logic. Table III: Bochvar s 3- valued Logic a 0 0 0 1/2 1/2 1/2 1 1 1 b 0 1/2 1 0 1/2 1 0 1/2 1 0 1/2 0 1/2 1/2 1/2 0 1/2 1 0 1/2 1 1/2 1/2 1/2 1 1/2 1 1 1/2 1 1/2 1/2 1/2 0 1/2 1 Table IV: Heyting s 3- valued Logic a 0 0 0 1/2 1/2 1/2 1 1 1 b 0 1/2 1 0 1/2 1 0 1/2 1 0 0 0 0 1/2 1/2 0 1/2 1 0 1/2 1 1/2 1/2 1 1 1 1 1 1 1 0 1 1 0 1/2 1 A fuzzy IF THEN rule consists of an IF part (antecedent) and a THEN part (consequent).the antecedent is a combination of terms, where as consequent is exactly one term. In the antecedent the terms can be combined by using Fuzzy Conjunction, Disjunction and Negation.

International Journal of Scientific and Research Publications, Volume 3, Issue 8, August 2013 5 Conclusion: This paper has emphasized two complementary types of information called negative and positive information and the idea of 3-valued Logics. Negative information acts as constraints that exclude possible worlds while positive information models observations that enable new possible worlds. It has been shown that if... then... rules convey both kinds of information, through their counterexamples and examples respectively. The existence of if-then rules, whose representation is based either on implications or on conjunctions can be explained by the existence of these two antagonistic views of information, Fuzzy rules and especially conjunctive.t( p) is common for Lukasiewicz and Bochvar s Logic, but it is not true for Heyting s Logic. These 3-valued Logics can be framed as rules where it is combined by using fuzzy conjunction, disjunction and negation. References [1]. Zadeh, L.: The calculus of fuzzy if-then rules. AI Expert 7 (1992) 23 27 [2]. Bouchon-Meunier, B., Dubois, D., Godo, L., Prade, H.: Fuzzy sets and possibility theory in approximateand plausible reasoning. In Bezdek, J., Dubois, D., Prade, H.,eds.: Fuzzy Sets in Approximate Reasoning and Information Systems. The Handbooks of Fuzzy Sets. Kluwer, Boston (1999) 15 190 [3]. Borgelt, C., Kruse, R.: Learning from imprecise data: Possibilistic graphical models. Computational Statistics and Data Analysis 38 (2002) 449 463 [4]. Gebhardt, J.: Learning from data: possibilistic graphical models. In: Abductive Reasoning and Uncertainty Management Systems. Volume 4 of Handbook of Defeasible reasoning and Uncertainty Management Systems (DRUMS). Kluwer Academic Publishers (2000) 315 389 [5]. Zadeh, L.: A theory of approximate reasoning. In J.E. Hayes, D.M., Mikulich, L., eds.: Machine Intellignece. Elsevier, NY, USA (1979) 149 194 [6]. Dubois, D., Hajek, P., Prade, H.: Knowledge driven vs. data driven logics. Journal of Logic, Language and Information 9 (2000) 65 89 [7]. Dubois, D., Prade, H.: A typology of fuzzy if..., then... rules. In: Proceedings of the 3rd International Fuzzy Systems Association Congress (IFSA 89), Seattle, WA (1989) 782 785 [8]. Dubois, D., Prade, H.: What are fuzzy rules and how to use them. Fuzzy Sets and Systems 84 (1996) 169 186 Special issue in memory of Prof A. Kaufmann. [9]. Zadeh, L.: Fuzzy sets as a basis for a theory of possibility. Fuzzy Sets and Systems 1 (1978) 3 28 [10]. Ughetto, L., Dubois, D., Prade, H.: Implicative and conjunctive fuzzy rules - A tool for reasoning from knowledge and examples. In: Proceedings of the 16th American National Conference on Artificial Intelligence (AAAI 99), Orlando, Fl, USA (1999) 214 219 [11]. Dubois, D., Martin-Clouaire, R., Prade, H.: Practical computing in fuzzy logic. In Gupta, M., Yamakawa, T., eds.: Fuzzy Computing. North-Holland, Amsterdam, Holland (1988) 11 34 [12]. Introduction to Fuzzy Sets and Fuzzy Logic, M Ganesh. [13]. Dr.G.Nirmala,G.Suvitha :Fuzzy Logic Gates in Electronic Circuits in International journal of Scientific & Research Publications, Volume 3, Issue 1, January 2013 edition. AUTHORS First Author - Dr. G. Nirmala, Associate Professor, P.G & Research Department of Mathematics, K.N.G Arts College for Women (Autonomous), Thanjavur- 613007.Tamil Nadu, India. Email Id: nirmalamanohar11@yahoo.com Correspondence Author G.Suvitha, Assistant Professor, Department of Mathematics, Sri Sai Ram Institute of Technology, West Tambaram, Chennai-600 044-Tamil Nadu,India. Email Id: Suvitha_g@yahoo.co.in. Mobile. No:+91 9965478748.