Copy Link
Add to Bookmark
Report
AIList Digest Volume 8 Issue 031
AIList Digest Monday, 1 Aug 1988 Volume 8 : Issue 31
Today's Topics:
Queries:
Expert Systems in computer design/configuration/administration
FRL
boolean reasoning
neurocomputing software on a SUN
computer chess
Large corpora of English text
a grammar for English
----------------------------------------------------------------------
Date: Mon, 25 Jul 88 17:21:30 CDT
From: Frank W Peters <PETERS%MSSTATE.BITNET@MITVMA.MIT.EDU>
Subject: Expert Systems in computer
design/configuration/administration
Hello,
I am beginning research into expert systems being used in the
design of computers, cofigurations of systems (that is, tailoring
a system to a specific users needs) and system administration
(such as problem diagnosis, resource alocation scheme advice and
so on).
I am seeking the following information:
1) Names and vendors of any such systems.
2) References to any articles or papers
relevant to this topic.
I would be gratefull for any assistance you can give me. Please
email any info directly to me and I will summarize to the list if
interest warrents.
Thank You
Frank Peters
*******************************************************************
* Frank Wayne Peters * Phone: (601) 325-2942 *
* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
* Electronic Address: * Snail Mail Address: *
* PETERS@MSSTATE.BITNET * Drawer CC *
* * Miss State, Ms. 39762 *
* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
* Disclaimers: *
* I make it a point to speak only for myself. If my boss *
* wants you to know what he thinks he'll tell you. *
* *
* ...it is a tale *
* Told by an idiot, full of sound and fury *
* Signifying nothing. *
* - Bill Somebody-or-Another *
*******************************************************************
------------------------------
Date: 27 Jul 88 05:11:06 GMT
From: mcvax!inria!crin!napoli@uunet.uu.net (Amedeo NAPOLI)
Subject: FRL
Who can tell me the semantics of the slot "classification" in the frame based
language FRL (Goldstein, Roberts 1977) ?
This slot may be assigned with either "generic" or "individual".
What do these values actually mean ? In particuliar, is it possible to
instantiate again a frame that has "individual" in its classification slot.
Moreover, is the language still available and, if so, how can I get it ?
Thanks in advance,
Amedeo Napoli
--
--- Amedeo Napoli @ CRIN / Centre de Recherche en Informatique de Nancy
EMAIL : napoli@crin.crin.fr - POST : BP 239, 54506 VANDOEUVRE CEDEX, France
------------------------------
Date: Thu, 28 Jul 88 15:47:20 BST
From: mcvax!duttnph!zepp@uunet.UU.NET (Frank Zeppenfeldt)
Subject: boolean reasoning
I'm a graduate student and currently looking into some problems
concerning low-level and boolean reasoning for (real-time) process
control. Till now the only literature I could find on this topic has
been the article :
Logical Controls via Boolean Rule Matrix Transformations
By : Carl G.Looney and Abdulrudah A.Alfize
IEEE Trans. on Systems, Man and Cybernetics ,
Vol SMC-17 no.6 Nov/Dec 1987
It describes how from an initial state of a truth-vector all the
possible truths can be deduced in one step, given a matrix which
represents the rules. This is done via the transitive closure of
the graph that is represented by the matrix.
Example 1 : initial rulebase a --> b /* a,b and c are boolean */
b --> c /* or 8 bits values */
becomes after computing the transitive closure ,
a --> b /* still the same */
b --> c /* idem */
a --> c /* new ! */
In this case, some matrix multiplications are sufficient.
Now suppose we have , a + b --> c
ac + d --> e,
things are getting more complex to express the LHS of e in terms of
a,b and d. The reason for determining the transitive closure of the
rulebase is the fact that I want to load these rules in their
Conjunctive Normal Format in a logic array and apply them in
parallel. Every use of some RHS result in a LHS of a rule will
generate a recursive entry. I want to avoid that in hardware.
My prolog solution is of complexity O(#rules^4) ! .
My questions :
1. The E-mail addresses of Mr. Looney or Mr.Alfize at
the University of Nevada.
2. Does somebody know about algorithms to compute the transi-
tive closure of such a rulebase or AND/OR graph (using the
available boolean instructions on microprocessors) ?
3. Is there anyone who can give me examples or references
using this kind of parallel production systems or low-
level reasoning ?
I thank you in advance for any reactions,
Frank Zeppenfeldt ..mcvax!dutrun!duttnph!zepp
University of Technology Delft
Department of Applied Physics
Pattern Recognition Group
Lorentzweg 1
2628 CJ Delft
The Netherlands.
------------------------------
Date: Thu, 28 Jul 88 11:24:16 EDT
From: Allen Wilkinson <urt@nav.icst.nbs.gov>
Subject: neurocomputing software on a SUN
Hello,
I am not a reader of this news group so if you can help me
with my problem please mail your responses to the address
below.
I am in need of information about neurocomputing software
and hardware for a SUN 3. Any information would be greatly
appreciated.
Thanks in advance,
/----------------------------------------------------------------------\
| ------- |
| R. Allen "Urt" Wilkinson / o o /| "Reality is only someone |
| National Bureau of Standards / o o /o| else's Fantasy." |
| Bldg 225 Room A216 ------- oo| |
| Gaithersburg, MD 20899 | o o |oo ---[ |
| ARPA: urt@icst-cmr.arpa | o |o/ -============( ]---O |
| DOMAIN: urt@cmr.icst.nbs.gov | o o |/ ---[ |
| ------- |
\----------------------------------------------------------------------/
------------------------------
Date: 28 Jul 88 15:41:00 GMT
From: uxe.cso.uiuc.edu!gupta@uxc.cso.uiuc.edu
Subject: computer chess
I will be starting my Master's this fall and am fascinated by Artificial
Intelligence - especially in computer chess.
Does anyone know of any good info (books, papers, authors, professors,
articles, research projects) on this subject?
Thanks
---
Rohit Gupta Internet: gupta%uxe.cso.uiuc.edu@uxc.cso.uiuc.edu
Champaign, Illinois UUCP: uunet!uiucuxc!uxe!gupta
------------------------------
Date: Thu, 28 Jul 88 12:30 PDT
From: Bagley.PA@Xerox.COM
Subject: Large corpora of English text
I am looking for public domain or commercially available corpora of
either written English or transcriptions of spoken English, preferably
significantly longer than a million characters. If it is tagged with
part-of-speech that would be great, but it isn't necessary. Thanks for
all assistance.
Steve Bagley
System Sciences Laboratory
Xerox PARC
3333 Coyote Hill Road
Palo Alto CA 94301
Bagley.pa@xerox.com
415-494-4331
------------------------------
Date: Thu, 28 Jul 88 18:01
From: "H.Ludwig Hausen +49-2241142426"
<HAUSEN%DBNGMD21.BITNET@MITVMA.MIT.EDU>
Subject: a grammar for English
We are also interested to obtain
grammars for English. Any computer-readable form is welcomed.
Thanks for any help.
H A N S - L U D W I G H A U S E N
GMD Schloss Birlinghoven Telefax +49-2241-14-2618
D-5205 Sankt Augustin 1 Teletex 2627-224135=GMD VV
West GERMANY Telex 8 89 469 gmd d
E-mail hausen@dbngmd21.BITNET
Telephone +49-2241-14-2440 or 2426
P.S.:GMD (Gesellschaft fuer Mathematik und Datenverarbeitung)
German National Research Institute of Computer Science
German Federal Ministry of Research and Technology (BMFT)
------------------------------
End of AIList Digest
********************
