On Elkan's theorems: Clarifying their meaning via simple proofs: Research Articles

  • Authors:
  • Radim Bělohlávek;George J. Klir

  • Affiliations:
  • Department of Computer Science, Palacký University, Tomkova 40, CZ-779 00, Olomouc, Czech Republic;Department of Systems Science and Industrial Engineering, Binghamton University—SUNY, Binghamton, NY 13902-6000, USA

  • Venue:
  • International Journal of Intelligent Systems
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.