On Elkan's theorems: Clarifying their meaning via simple proofs
This article deals with the claims that “a standard version of fuzzy logic collapses mathematically to two‐valued logic” made by Charles Elkan in two papers [Proc 11th National Conf on AI, Menlo Park, CA: AAAI Press, 1993, pp 698–703; IEEE Expert 1994;9:3–8]. Although Elkan's effort to triviali...
Saved in:
Published in: | International journal of intelligent systems Vol. 22; no. 2; pp. 203 - 207 |
---|---|
Main Authors: | , |
Format: | Journal Article |
Language: | English |
Published: |
Hoboken
Wiley Subscription Services, Inc., A Wiley Company
01-02-2007
|
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | This article deals with the claims that “a standard version of fuzzy logic collapses mathematically to two‐valued logic” made by Charles Elkan in two papers [Proc 11th National Conf on AI, Menlo Park, CA: AAAI Press, 1993, pp 698–703; IEEE Expert 1994;9:3–8]. Although Elkan's effort to trivialize fuzzy logic has been questioned by numerous authors, our aim is to examine in detail his formal arguments and make some new observations. We present alternative, considerably simpler proofs of Elkan's theorems and use these proofs to argue that Elkan's claims are unwarranted. © 2007 Wiley Periodicals, Inc. Int J Int Syst 22: 203–207, 2007. |
---|---|
Bibliography: | ark:/67375/WNG-NJD3QQS9-2 ArticleID:INT20194 istex:E90BBBF07AE139C5133889C555EF4DD3A13E53F1 MSM - No. 6198959214 ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
ISSN: | 0884-8173 1098-111X |
DOI: | 10.1002/int.20194 |