From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=-1.9 required=5.0 tests=BAYES_00 autolearn=ham
	autolearn_force=no version=3.4.4
X-Google-Thread: 103376,c40c26da14123526
X-Google-Attributes: gid103376,public
X-Google-Language: ENGLISH,ASCII-7-bit
Path: 
 g2news1.google.com!postnews.google.com!g44g2000cwa.googlegroups.com!not-for-mail
From: "Craig Carey <research@ijs.co.nz>" <research@ijs.co.nz>
Newsgroups: comp.lang.ada
Subject: Re: fuzzy logic
Date: 23 Aug 2005 06:23:18 -0700
Organization: http://groups.google.com
Message-ID: <1124803398.655387.185810@g44g2000cwa.googlegroups.com>
References: <4301d21d$0$192$edfadb0f@dread11.news.tele.dk>
   <kk3dmji2b7yi$.1zej60nowbfw.dlg@40tude.net>
NNTP-Posting-Host: 210.185.5.10
Mime-Version: 1.0
Content-Type: text/plain; charset="iso-8859-1"
X-Trace: posting.google.com 1124803404 16897 127.0.0.1 (23 Aug 2005 13:23:24
 GMT)
X-Complaints-To: groups-abuse@google.com
NNTP-Posting-Date: Tue, 23 Aug 2005 13:23:24 +0000 (UTC)
User-Agent: G2/0.2
Complaints-To: groups-abuse@google.com
Injection-Info: g44g2000cwa.googlegroups.com; posting-host=210.185.5.10;
   posting-account=VAk6zg0AAAAB8m7bE8j11Y9JsY1KL2hL
Xref: g2news1.google.com comp.lang.ada:4259
Date: 2005-08-23T06:23:18-07:00
List-Id: <comp.lang.ada>

On Tue, 16 Aug 2005 15:03:41 +0200, "Dmitry A. Kazakov" wrote:
>On Tue, 16 Aug 2005 13:46:37 +0200, Poul-Erik Andreasen wrote:
>> ...source-code examples of the use of Dmitry A. Kazakov's  fuzzy-logic
>> library?.
...
>P.S. If that is not directly related to Ada, then comp.ai.fuzzy is a better
>place to discuss it. Or write me (E-mail is on the page.)


A tall rectangle can fit inside of a smaller square, providing that the
former has no volume and isn't even a line. It seems plausible to
replace
real numbers (used in science, etc.) with 'fuzzy logic' polytopes, but
idea seems to too flawed to make it.

Suppose Booleans are replaced with non-negative reals, and 'and' means
 'Max', and 'or' is 'Min'

This:

   4 and (2*(0<x) or 3*(0<y));

would simplify to this:

   2*(0<x) or 3*(0<y);

since the second term takes values in the range 0 to 3, and that is
 smaller than 4.

So maybe to implement simplifying, subexpressions would be recursed
over,
 and the upper and lower values would be computed.

Let "implies" mean that one polytope fits inside of another.
E.g. simplify "P implies Q" where P and Q are rectanges:

   Tall rectangle: P = (0<y<10)(1<x<1)  [empty]
   Short square:   Q = (0<y<3)(0<x<2)

To simplify  "a*F implies b*G",  could make the answer be
     (a<=b) and (All ...)(F implies G)

Substituting in from the example: a=10, F=(1<x<1), b=3, G=(0<x<2)
Then the algorithm finds that P is not inside of Q since not (10<=3).

So that algorithm is wrong.

It certainly seems that the best way to proceed is to throw away
fuzzy logic and for the relatively infrequent cases when it is needed,
an extra variable (the "y" above), can be used.

'Not' need not be defined (it could be that 'Not x' equals 1-x or x<1).


I just deleted Zadeh Booleans (fuzzy logic) from my symbolic algebra
code. It seems that classical logic seems better despite how
non-negatives
are a convenient extrapolation (a use of an extrapolating principle
that
almost opposes itself in this topic).


Craig Carey
research@ijs.co.nz