Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Fuzzy set
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
== Fuzzy logic == {{main|Fuzzy logic}} As an extension of the case of [[multi-valued logic]], valuations (<math>\mu : \mathit{V}_o \to \mathit{W}</math>) of [[propositional variable]]s (<math>\mathit{V}_o</math>) into a set of membership degrees (<math>\mathit{W}</math>) can be thought of as [[membership function (mathematics)|membership functions]] mapping [[Predicate (mathematical logic)|predicates]] into fuzzy sets (or more formally, into an ordered set of fuzzy pairs, called a fuzzy relation). With these valuations, many-valued logic can be extended to allow for fuzzy [[premise]]s from which graded conclusions may be drawn.<ref>[[Siegfried Gottwald]], 2001. ''A Treatise on Many-Valued Logics''. Baldock, Hertfordshire, England: Research Studies Press Ltd., {{ISBN|978-0-86380-262-1}}</ref> This extension is sometimes called "fuzzy logic in the narrow sense" as opposed to "fuzzy logic in the wider sense," which originated in the [[engineering]] fields of [[automation|automated]] control and [[knowledge engineering]], and which encompasses many topics involving fuzzy sets and "approximated reasoning."<ref>{{cite journal | doi=10.1016/0020-0255(75)90036-5 | title=The concept of a linguistic variable and its application to approximate reasoning—I | date=1975 | last1=Zadeh | first1=L.A. | journal=Information Sciences | volume=8 | issue=3 | pages=199–249 }}</ref> Industrial applications of fuzzy sets in the context of "fuzzy logic in the wider sense" can be found at [[fuzzy logic]].
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)