Charles Elkan

From Chessprogramming wiki
Revision as of 18:29, 20 July 2019 by GerdIsenberg (talk | contribs) (Created page with "'''Home * People * Charles Elkan''' FILE:CElkan.jpg|border|right|thumb|link=http://cseweb.ucsd.edu/~elkan/| Charles Elkan <ref>[http://cseweb.ucsd.edu/~e...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

Home * People * Charles Elkan

Charles Elkan [1]

Charles Elkan,
an American mathematician, computer scientist and professor in the computer science and engineering department at University of California, San Diego. His research interests include machine learning, neural networks, fuzzy logic, data mining, and analytics. In 1989, Charles Elkan applied conspiracy numbers to theorem proving [2], similar to Victor Allis' Proof-number search algorithm.

Fuzzy Paradox

Implication

In 1993 Elkan identified a paradox that fuzzy logic equivalents (min, max, 1-x) of the equivalence of two re-expressions of the material implication a → b

 ~(a & ~b) = (~a & ~b) | b

that is

1 - max(a, 1-b) = max(min(1-a, 1-b), b)

is not true for a < b < 0.5.

Selected Publications

[3] [4]

1988 ...

1990 ...

2000 ...

2010 ...

External Links

References

Up one level