Fuzzy logic From Wikipedia, the free encyclopedia Fuzzy logic is a form of many-valued logic; it deals with

reasoning that is approximate rather than fixed and exact. Compared to traditional binary sets (where variables may take on true or false values) fuzzy logic variables may have a truth value that ranges in degree between 0 and 1. Fuzzy logic has been extended to handle the concept of partial truth, where the truth value may range between completely true and completely false.[1] Furthermore, when linguistic variables are used, these degrees may be managed by specific functions. Irrationality can be described in terms of what is known as the fuzzjective.[citation needed] The term "fuzzy logic" was introduced with the 1965 proposal of fuzzy set theory by Lotfi A. Zadeh.[2][3] Fuzzy logic has been applied to many fields, from control theory to artificial intelligence. Fuzzy logics however had been studied since the 1920s as infinite-valued logics notably by Łukasiewicz and Tarski.[4] Contents [hide] 1 Overview 1.1 Applying truth values 1.2 Linguistic variables 2 Early applications 3 Example 3.1 Hard science with IF-THEN rules 4 Logical analysis 4.1 Propositional fuzzy logics 4.2 Predicate fuzzy logics 4.3 Decidability issues for fuzzy logic 4.4 Synthesis of fuzzy logic functions given in tabular form 5 Fuzzy databases 6 Comparison to probability 7 Relation to ecorithms 8 See also 9 References 10 Bibliography 11 External links Overview[edit]

Classical logic only permits propositions having a value of truth or falsity. The notion of whether 1+1=2 is absolute, immutable, mathematical truth. However, there exist certain propositions with variable answers,

earthquake prediction and modeling at the Institute of Seismology Bureau of Metrology in Japan[citation needed].such as asking various people to identify a color. Another designer might equally well design a set membership function where the glass would be considered full for all values down to 50 ml. Both degrees of truth and probabilities range between 0 and 1 and hence may seem similar at first. For instance. Since the red arrow points to zero.[6] It has also been used in recognition of hand written symbols in Sony pocket computers[citation needed]. Linguistic variables[edit] While variables in mathematics usually take numerical values. Fuzzy logic temperature In this image. It is essential to realize that fuzzy logic uses truth degrees as a mathematical model of the vagueness phenomenon while probability is a mathematical model of ignorance. a temperature measurement for anti-lock brakes might have several separate membership functions defining particular temperature ranges needed to control the brakes properly. in fuzzy logic applications. The linguistic hedges can be associated with certain functions. in which fuzzy logic was able to improve the economy. Applying truth values[edit] A basic application might characterize subranges of a continuous variable. but rather a means of representing and reasoning over partial knowledge is afforded. The first notable application was on the high-speed train in Sendai.8) "fairly cold". Note that the concept of emptiness would be subjective and thus would depend on the observer or designer. etc. this temperature may be interpreted as "not hot". A point on that scale has three "truth values"—one for each of the three functions. and hot are represented by functions mapping a temperature scale. However.2) may describe it as "slightly warm" and the blue arrow (pointing at 0. comfort.7 empty and 0. The orange arrow (pointing at 0. The notion of truth doesn't fall by the wayside.[5] A linguistic variable such as age may have a value such as young or its antonym old. Example[edit] . These truth values can then be used to determine how the brakes should be controlled. Canon auto-focus technology[citation needed]. The vertical line in the image represents a particular temperature that the three arrows (truth values) gauge. by aggregating all possible outcomes into a dimensional spectrum. the great utility of linguistic variables is that they can be modified via linguistic hedges applied to primary terms. For example. warm. The meaning of each of them can be represented by a certain fuzzy set. the meanings of the expressions cold. Each function maps the same temperature value to a truth value in the 0 to 1 range. Omron auto-aiming cameras[citation needed]. let a 100 ml glass contain 30 ml of water. the non-numeric linguistic variables are often used to facilitate the expression of rules and facts.3 full. Early applications[edit] The Japanese were the first to utilize fuzzy logic for practical applications. Then one might define the glass as being 0. Then we may consider two concepts: Empty and Full. and precision of the ride.

truth(y)) x OR y = maximum(truth(x). Propositional fuzzy logics[edit] The most important propositional fuzzy logics are: Monoidal t-norm-based propositional fuzzy logic MTL is an axiomatization of logic where conjunction is defined by a left continuous t-norm.Hard science with IF-THEN rules[edit] Fuzzy set theory defines fuzzy operators on fuzzy sets. and implication is also defined as the residuum of the t-norm. Łukasiewicz fuzzy logic is the extension of basic fuzzy logic BL where standard conjunction is the Łukasiewicz t-norm. when they are defined this way. most of them belong among socalled t-norm fuzzy logics. and NOT operators of boolean logic exist in fuzzy logic. which modify the meaning of a set using a mathematical formula. Logical analysis[edit] In mathematical logic. Its models correspond to MTL-algebras that are prelinear commutative bounded integral residuated lattices. and its models correspond to MV-algebras. For this reason. Rules are usually expressed in the form: IF variable IS property THEN action For example. It has the axioms of basic fuzzy logic plus an axiom of double negation. truth(y)) There are also other operators. called hedges that can be applied. and implication is defined as the residuum of the t-norm. The problem in applying this is that the appropriate fuzzy operator may not be known. they are called the Zadeh operators. there are several formal systems of "fuzzy logic". more linguistic in nature. usually defined as the minimum. maximum. Its models correspond to BLalgebras. fuzzy logic usually uses IF-THEN rules. These are generally adverbs such as "very". and complement. or constructs that are equivalent. a simple temperature regulator that uses a fan might look like this: IF temperature IS very cold THEN stop fan IF temperature IS cold THEN turn down fan IF temperature IS normal THEN maintain level IF temperature IS hot THEN speed up fan There is no "ELSE" – all of the rules are evaluated.truth(x)) x AND y = minimum(truth(x). . such as fuzzy associative matrices. Basic propositional fuzzy logic BL is an extension of MTL logic where conjunction is defined by a continuous t-norm. OR. or "somewhat". So for the fuzzy variables x and y: NOT x = (1 . The AND. because the temperature might be "cold" and "normal" at the same time to different degrees.

Then a fuzzy subset s : S \rightarrow[0. Synthesis of fuzzy logic functions given in tabular form[edit] It is known that any boolean logic function could be represented using a truth table mapping each set of variable values into set of values {0. for every x in S. It has the axioms of BL plus an axiom of idempotence of conjunction. It has the axioms of BL plus another axiom for cancellativity of conjunction. This means that each formula has an evaluation. We say that s is decidable if both s and its complement –s are recursively enumerable. Indeed. Moreover. x2. It is an open question to give supports for a Church thesis for fuzzy mathematics the proposed notion of recursive enumerability for fuzzy subsets is the adequate one. To this aim. Biacino and G.1].Gödel fuzzy logic is the extension of basic fuzzy logic BL where conjunction is Gödel t-norm. and its models are called G-algebras. A choice table maps each variant into value of an argument or a negation of an argument. ¬x2 and the corresponding function value . in EVŁ is evaluated also syntax. Markov normal fuzzy algorithm and fuzzy program (see Santos 1970).1] of a set S is recursively enumerable if a recursive map h : S×N \rightarrowÜ exists such that. the fuzzy set of logically true formulas is recursively enumerable in spite of the fact that the crisp set of valid formulas is not recursively enumerable. An extension of such a theory to the general case of the L-subsets is possible (see Gerla 2006).n). ¬x1. For instance. Each fuzzy (continuous) logic function could be represented by a choice table containing all possible variants of comparing arguments and their negations.S. L. Predicate fuzzy logics[edit] These extend the above-mentioned fuzzy logics by adding universal and existential quantifiers in a manner similar to the way that predicate logic is created from propositional logic. Theorem. A first proposal in such a direction was made by E. The proposed definitions are well related with fuzzy logic. In particular. Gerla argued that the proposed definitions are rather questionable and therefore they proposed the following ones. Thus the question of a suitable extension of these concepts to fuzzy set theory arises.1}. the following theorem holds true (provided that the deduction apparatus of the considered fuzzy logic satisfies some obvious effectiveness property). any axiomatizable and complete theory is decidable. Decidability issues for fuzzy logic[edit] The notions of a "decidable subset" and "recursively enumerable subset" are basic ones for classical mathematics and classical logic. While the above kinds of fuzzy logic have traditional syntax and many-valued semantics. Santos by the notions of fuzzy Turing machine. Fuzzy logic with evaluated syntax (sometimes also called Pavelka's logic). denoted by EVŁ. Successively. an extension of the notions of fuzzy grammar and fuzzy Turing machine should be necessary (see for example Wiedermann's paper). The semantics of the universal (resp. Axiomatization of EVŁ stems from Łukasziewicz fuzzy logic. The task of synthesis of boolean logic function given in tabular form is one of basic tasks in traditional logic that is solved via disjunctive (conjunctive) perfect normal form. existential) quantifier in t-norm fuzzy logics is the infimum (resp.n) is increasing with respect to n and s(x) = lim h(x. A generalization of classical Gödel completeness theorem is provable in EVŁ. Denote by Ü the set of rational numbers in [0. Any axiomatizable fuzzy theory is recursively enumerable. in general. and its models are called product algebras. the function h(x. Another open question is to start from this notion to find an extension of Gödel's theorems to fuzzy logic. for two arguments a row of choice table contains a variant of comparing values x1. Product fuzzy logic is the extension of basic fuzzy logic BL where conjunction is product t-norm. is a further generalization of mathematical fuzzy logic. supremum) of the truth degrees of the instances of the quantified subformula.

On the other hand. some other models arose like the Buckles-Petry model. See in particular p. the fuzzy-logic-derived possibility measure is inherently different from the probability measure. Leslie Valiant. 58 of the reference comparing induction/invariance. fuzzy thresholds. dynamical systems. and probability theory uses the concept of subjective probability (i. The sufficient and necessary conditions that a choice table defines a fuzzy logic function were derived. Valiant essentially redefines machine learning as evolutionary. Bart Kosko argues[citation needed] that probability is a subtheory of fuzzy logic. and the paradoxes of Dempster-Shafer theory. He fuzzified probability to fuzzy probability and also generalized it to what is called possibility theory. the Prade-Testemale Model.M. and the FSQL by J. (cf.f( x 2 ≤ ¬x1 ≤ x1 ≤ ¬x2 ) = ¬x1 The task of synthesis of fuzzy logic function given in tabular form was solved in. However. fuzzy comparators. fuzzy logic is one of many different proposed extensions to classical logic. although feedback and feedforward. and is not a replacement for it. Comparison to probability[edit] Fuzzy logic and probability are different ways of expressing uncertainty. it is possible to develop fuzzy relational databases. for example. Ecorithms and fuzzy logic also have the common property of dealing with possibilities more than probabilities. appeared in Maria Zemankova's dissertation. The first fuzzy relational database. M. as probability only handles one kind of uncertainty. Galindo et al.[8]) More generally. basically stochastic "weights. While this distinction is mostly philosophical. fuzzy constants. FRDB. While both fuzzy logic and probability theory can be used to represent subjective belief. Lotfi A.[7] New concepts of constituents of minimum and maximum were introduced. In general use. approximate and simplify solution logic. co-author of the Valiant-Vazirani theorem. Vila et al. known as probabilistic logics.e. Medina. mathematical and other logical limits in computing. ecorithms are algorithms that learn from their more complex environments (hence eco) to generalize. where techniques including fuzzy logic and natural data selection (ala .A. Bosc et al. Zadeh argues that fuzzy logic is different in character from probability. how probable do I think that a variable is in a set). linguistic labels and so on. they are methods used to overcome continuous variables or systems too complex to completely enumerate or understand discretely or exactly.. Fuzzy databases[edit] Once fuzzy relations are defined. many statisticians are persuaded by the work of Bruno de Finetti that only one kind of mathematical uncertainty is needed and thus fuzzy logic is unnecessary. fuzzy set theory uses the concept of fuzzy set membership (i. In the context of fuzzy databases. robust. hence they are not directly equivalent. Relation to ecorithms[edit] Harvard's Dr. Like fuzzy logic. highlighting the SQLf by P. intended to deal with issues of uncertainty in classical logic..e. the inapplicability of probability theory in many domains. like fuzzy conditions. the Umano-Fukami model or the GEFRED model by J. fuzzy constraints." are a feature of both when dealing with. Later. some fuzzy querying languages have been defined. He also claims[citation needed] to have proven a derivation of Bayes' theorem from the concept of fuzzy subsethood. how much a variable is in a set). uses the term "ecorithms" to describe how many less exact systems and techniques like fuzzy logic (and "less robust" logic) can be applied to learning algorithms (a field redirected on Wiki to Machine learning). These languages define some structures in order to include fuzzy aspects in the SQL statements.

."computational Darwinism") can be used to shortcut computational complexity and limits in a "practical" way (such as the brake temperature example in this article).

Sign up to vote on this title
UsefulNot useful

Master Your Semester with Scribd & The New York Times

Special offer: Get 4 months of Scribd and The New York Times for just $1.87 per week!

Master Your Semester with a Special Offer from Scribd & The New York Times