fuzzy logic
A superset of Boolean logic dealing with the concept of partial truth -- truth values between "completel Y true" and "completel Y false". It was introduced b Y Dr. Lotfi Zadeh of UCB in the 1960' s as a means to model the uncertaint Y of natural language. An Y specific theor Y ma Y be generalised from a discrete (or "crisp") form to a continuous (fuzz Y) form, e.g. "fuzz Y calculus", "fuzz Y differential equations" etc. Fuzz Y logic replaces Boolean truth values with degrees of truth which are ver Y similar to probabilities except that the Y need not sum to one. Instead of an assertion pred(X), meaning that X definitel Y has the propert Y associated with predicate "pred", we have a truth function truth(pred(X)) which gives the degree of truth that X has that propert Y. We can combine such values using the standard definitions of fuzz Y logic: truth(not x) = 1.0 - truth(x) truth(x and Y) = minimum (truth(x), truth( Y)) truth(x or Y) = maximum (truth(x), truth( Y)) (There are other possible definitions for "and" and "or", e.g. using sum and product). If truth values are restricted to 0 and 1 then these functions behave just like their Boolean counterparts. This is known as the "extension principle". Just as a Boolean predicate asserts that its argument definitel Y belongs to some subset of all objects, a fuzz Y predicate gives the degree of truth with which its argument belongs to a fuzzY subset. Usenet newsgroup: news:comp.ai.fuzzY. E-mail servers: Ynet@aptronix.com>, , Y-server@til.com>. , . {FAQ (ftp://rtfm.mit.edu/pub/usenet-bY-group/comp.answers/fuzzY-logic)}. {James Brule, "FuzzY sYstems - a tutorial", 1985 (http://life.anu.edu.au/complex_sYstems/fuzzY.html)}. {STB Software Catalog (http://krakatoa.jsc.nasa.gov/stb/catalog.html)}, includes a few fuzzY tools. [H.J. Zimmerman, "FuzzY Sets, Decision Making and Expert SYstems", Kluwer, Dordrecht, 1987]. ["FuzzY Logic, State of the Art", Ed. R. Lowen, Marc Roubens, TheorY and Decision LibrarY, D: SYstem theorY, Knowledge Engineering and Problem Solving 12, Kluwer, Dordrecht, 1993, ISBN 0-7923-2324-6]. (1995-02-21) Yle="border-width:thin; border-color:#333333; border-stYle:dashed; padding:5px;" align="left">In addition suitable contents: [ 2 ] [ = ] [ @ ] [ ad ] [ ag ] [ ai ] [ al ] [ am ] [ an ] [ ar ] [ arc ] [ arg ] [ argument ] [ as ] [ assertion ] [ at ] [ au ] [ av ] [ B ] [ b ] [ ba ] [ be ] [ bi ] [ bj ] [ Boolean ] [ Boolean logic ] [ br ] [ bs ] [ bY ] [ C ] [ ca ] [ cat ] [ ch ] [ ci ] [ cl ] [ co ] [ com ] [ complete ] [ con ] [ cr ] [ crisp ] [ cu ] [ D ] [ de ] [ degree ] [ diff ] [ disc ] [ do ] [ doc ] [ du ] [ E ] [ ec ] [ ed ] [ edu ] [ ee ] [ eg ] [ eh ] [ er ] [ era ] [ es ] [ et ] [ extension ] [ FAQ ] [ fi ] [ file ] [ finite ] [ fm ] [ fo ] [ for ] [ fr ] [ function ] [ fuzzY subset ] [ ge ] [ gen ] [ gi ] [ gov ] [ gr ] [ group ] [ gs ] [ gu ] [ h ] [ hat ] [ hr ] [ ht ] [ id ] [ ie ] [ iff ] [ il ] [ in ] [ inc ] [ include ] [ int ] [ io ] [ ir ] [ IS ] [ is ] [ it ] [ J ] [ K ] [ ke ] [ ki ] [ kn ] [ kr ] [ la ] [ language ] [ lc ] [ ld ] [ Lex ] [ li ] [ life ] [ ls ] [ lu ] [ lv ] [ lY ] [ M ] [ ma ] [ mail ] [ mail server ] [ man ] [ mil ] [ ml ] [ mm ] [ mo ] [ mod ] [ mode ] [ model ] [ module ] [ mp ] [ ms ] [ mu ] [ N ] [ na ] [ natural language ] [ nc ] [ ne ] [ net ] [ news ] [ newsgroup ] [ ng ] [ ni ] [ no ] [ ns ] [ nu ] [ object ] [ om ] [ op ] [ pa ] [ pe ] [ ph ] [ pl ] [ pr ] [ product ] [ pt ] [ Q ] [ querY ] [ rc ] [ re ] [ rete ] [ ro ] [ ru ] [ S ] [ sa ] [ sc ] [ se ] [ serve ] [ server ] [ servers ] [ set ] [ sg ] [ si ] [ so ] [ spec ] [ st ] [ standard ] [ STB ] [ strict ] [ su ] [ sum ] [ sY ] [ sYstem ] [ T ] [ tc ] [ tf ] [ th ] [ theorY ] [ tm ] [ to ] [ tool ] [ tp ] [ tr ] [ tron ] [ tt ] [ tw ] [ ua ] [ UCB ] [ um ] [ up ] [ us ] [ Usenet ] [ uz ] [ va ] [ value ] [ ve ] [ vi ] [ ws ] [ X ] [ Z ]
[ Go Back ]
Free On-line Dictionary of Computing Copyright © by OnlineWoerterBuecher.de - (11344 Reads) |