Copy Link
Add to Bookmark
Report
AIList Digest Volume 4 Issue 203
AIList Digest Monday, 6 Oct 1986 Volume 4 : Issue 203
Today's Topics:
Query - Prolog Chemistry Systems & RuleMaster & AI Graduate Programs &
Expert Systems and Deep Knowledge & Textbook for ES Applications &
Communications Expert Systems & Generic Expert System &
Integrated Inference Machines & Byte Prolog & Digitalk Smalltalk,
AI Tools - Digitalk Smalltalk & Line Expert & XLISP &OPS5,
Vision - Face Recognition,
Logic Programming - TMS Loops
----------------------------------------------------------------------
Date: Sun, 28 Sep 86 10:46:15 -0200
From: Jacob Levy <jaakov%wisdom.bitnet@WISCVM.WISC.EDU>
Subject: Chemistry systems & PROLOG
Has anyone programmed or used a logic programming based system for
use in Chemistry? I am especially interested in organic synthesis planning
systems. Do you know of such systems written in other languages? Any help,
references and info will be greatly appreciated,
Thanks
Rusty Red (AKA Jacob Levy)
BITNET: jaakov@wisdom
ARPA: jaakov%wisdom.bitnet@wiscvm.ARPA
CSNET: jaakov%wisdom.bitnet@csnet-relay
UUCP: jaakov@wisdom.uucp
------------------------------
Date: Sat, 27 Sep 86 09:15:20 cdt
From: Esmail Bonakdarian <bonak%cs.uiowa.edu@CSNET-RELAY.ARPA>
Subject: RuleMaster
Anybody out there have any comments about RuleMaster? RuleMaster
(a product of the Radian Corporation) is a software tool for
supporting the development of expert systems. I would be grateful
for any information, comments from people who have used this package
(especially on a DOS machine) etc.
If there is enought interest I will collect and post all of the
responses back to AIlist.
Thanks,
Esmail
------------------------------
Date: 29 Sep 86 00:29:16 GMT
From: gatech!gitpyr!krubin@seismo.css.gov (Kenny Rubin)
Subject: Differences among Grad AI programs
The following is a request for information about the
differences among the various universities that offer graduate
degrees in AI. I apologize in advance if this topic has received
prior discussion, I have been out the country for a few months
and did not have access to the net.
The goal of all this is to compile a current profile of
the graduate AI programs at the different universities. Thus, any
information about the different programs such as particular strengths
and weaknesses would be useful. Also, a comparison and/or conclusions
drawn between the various programs would be helpful.
I am essentially interested in the areas of AI that each
university performs research in. For example research pertaining
to Knowledge Representation, Natural Language Processing, Expert
System Development, Learning, Robotics, etc...
Basically anything that you think potential applicants to
the various universities would like to know, would be helpful. Feel
free to comment about the university(ies) that you know best:
- MIT, CMU, Yale, Standford, UC Berkeley, UCLA, etc...
Please send all response by E-mail to me to reduce net traffic.
If there is sufficient interest, I will post a compiled summary.
Kenneth S. Rubin (404) 894-2348
Center for Man-Machine Systems Research
School of Industrial and Systems Engineering
Georgia Institute of Technology
Post Office Box 35826
Atlanta, Georgia 30332
Majoring with: School of Information and Computer Science
...!{akgua,allegra,amd,hplabs,ihnp4,seismo,ut-ngp}!gatech!gitpyr!krubin
------------------------------
Date: 29 Sep 86 18:43:08 GMT
From: mcvax!kvvax4!rolfs@seismo.css.gov (Rolf Skatteboe)
Subject: Expert systems and deep knowledge
Hello:
For the time being, I'm working on my MSc thesis with main goal to
investigate the combination of knowledge based diagnosis system and
the use of mathematical models of gas turbines. I will used this models as
deep knowledge in order to improve the results of the diagnosis system.
The models can be used both as early warning fault systems and as sensor
verification and test. The model can also be used to evaluate changes in
machine parameters caused by engine degradiation.
So far I have found some articles about diagnostic reasoning based on structure
and behavior for digital electronic hardware.
While I'm trying to find the best system structure for a demonstration system,
I would like to get hold on information (articles references, program
examples, and other people's experiences) both on using deep knowledge
in expert systems in general, and the use of mathematical models in
particular.
I hope that someone can help me.
Grethe Tangen
Kongsberg KVATRO, NORWAY
------------------------------
Date: 3 Oct 1986 0904-EDT
From: Holger Sommer <SOMMER@C.CS.CMU.EDU>
Subject: Expert system Textbook For Applications
I was asked to develop a course for Undergrad seniors and Beginning
Graduated Students in Engineering, an introductory course for Expert
System Technology with the focus on Application. I am looking for a
suitable introductory textbook at the beginners level which could help
me to get the students familiar with AI in general and expert systems
specifically. Also if anyone has some experiance teachning a course for
non-computer science students in the AI area I would appreciate our
comments. Please send mail to Sommer@c.cs.cmu.edu
------------------------------
Date: Mon, 29 Sep 86 10:42:27 edt
From: Lisa Meyer <lem%galbp.uucp@CSNET-RELAY.ARPA>
Subject: Request for Info on Expert Systems Development
I am a senior Info & Computer Science major at Georgia Tech. I will be
constructing an Expert System to diagnose communications setups & their
problems for my senior design project at the request of my cooperative
ed. employer. I have only had an introductory course in AI, so a large
part of this project will be spent on researching information on expert
system development.
Any information on : Constructing Expert Systems (esp. for diagnostics)
PC versions of Languages suitable for building
Expert Systems
Public Domain Expert Systems, ES Shells, or de-
velopment tools
Or good books, articles, or references to the
subjects listed above
WOULD BE GREATLY APPRECIATED. As the goal of my project is to con-
struct a working diagnostic expert system and not to learn every-
thing there is to know about AI, pointers to good sources of
infromation, copies of applicable source, and information those
who ARE knowledgable in the field of AI and Expert System Con-
struction would be EXTREMELY HELPFUL.
THANKS IN ADVANCE,
Lisa Meyer (404-329-8022)
Atlanta, GA
=====================================================================
Lisa Meyer
Harris / Lanier
Computer R&D (Cooperative Education Program)
Information & Computer Science Major
Georgia Institute of Technology Georgia I
Ga. Tech Box 30750, Atlanta Ga. 30332
{akgua,akgub,gatech}!galbp!lem
=====================================================================
------------------------------
Date: 30 Sep 86 13:34:16 GMT
From: lrl%psuvm.bitnet@ucbvax.Berkeley.EDU
Subject: Expert System Wanted
Does anyone know of a general purpose expert system available for VM/CMS?
I'm looking for one that would be used on a university campus by a variety
of researchers in different disciplines. Each researcher would feed their
own rules into it.
Also, can anyone recommend readings, conferences, etc. for someone getting
started in this field?
Thanks.
Linda Littleton phone: (814) 863-0422
214 Computer Building bitnet: LRL at PSUVM
Pennsylvania State University
University Park, PA 16802
------------------------------
Date: Tue, 30 Sep 86 0:19:04 CDT
From: Glenn Veach <veach%ukans.csnet@CSNET-RELAY.ARPA>
Subject: Address???
In a recent summary of the Spang-Robinson Report reference was made to the
company "Integrated Inference Machines". Does anyone have an address for them?
------------------------------
Date: 2 Oct 86 18:21:29 GMT
From: john@unix.macc.wisc.edu (John Jacobsen)
Subject: pd prolog
!!!!!!!!!!!!!!
Does anyone have the public domain prolog package discussed in this month's
BYTE magazine?
John E. Jacobsen
University of Wisconsin -- Madison Academic Computing Center
------------------------------
Date: 4 Oct 86 00:32:11 GMT
From: humu!uhmanoa!todd@bass.nosc.mil (Todd Ogasawara)
Subject: Digitalk Smalltalk for the PC
If anyone out there has played with the version of Smalltalk for the
PC by Digitalk, I'd like to get your opinions. I am especially
interested in the object-oriented version of Prolog that comes with
the package. Thanks..todd
Todd Ogasawara, University of Hawaii
Dept. of Psychology & U. of Hawaii Computing Center
UUCP: {ihnp4,dual,vortex}!islenet!
\
\__ uhmanoa!todd
/
{backbone}!sdcsvax!noscvax!humu!/
/
clyde/
[soon to change to uhccux!todd]
ARPA: humu!uhmanoa!todd@noscvax
** I used to be: ogasawar@nosc.ARPA & ogasawar@noscvax.UUCP
------------------------------
Date: 4 Oct 86 23:56:43 GMT
From: spdcc!dyer@harvard.harvard.edu (Steve Dyer)
Subject: Re: Digitalk Smalltalk for the PC
I have it and am very impressed. Perhaps more convincing though, I have
a friend who's been intimately involved with Smalltalk development
from the very beginning who was also very impressed. It's even more
remarkable because the Digitalk folks didn't license the Smalltalk-80
virtual machine from Xerox; they developed their system from the formal
and not-so-formal specifications of Smalltalk 80 available in the public
domain. Apparently, they can call their system "Smalltalk V" because
"Smalltalk" isn't a trademark of Xerox; only "Smalltalk-80" is.
I haven't played with their Prolog system written in Smalltalk.
--
Steve Dyer
dyer@harvard.HARVARD.EDU
{linus,wanginst,bbnccv,harvard,ima,ihnp4}!spdcc!dyer
------------------------------
Date: 3 Oct 1986 13:30:37 EDT
From: David Smith <DAVSMITH@A.ISI.EDU>
Subject: Communications Experts
I was curious to find out about Werner Uhrig's question (9/10) relating
to an Infoworld article from Smyrna, Ga since Ga is not exactly a
hotbed of AI activity. I spoke to Nat Atwell of Concept
Development Systems about Line Expert ($49.95). It is apparently
an off-line Turbo Prolog application with knowledge about data
set interfacing, known problems etc., including the ability to draw
schematics of cables on the screen for you. For more info,
call nat at (404) 434-4813.
------------------------------
Date: Fri, 26 Sep 86 11:06 PDT
From: JREECE%sc.intel.com@CSNET-RELAY.ARPA
Subject: XLISP Availability
Although XLISP is available on a number of PC bulletin boards, your best bet
for the PC version would be the BIX network run by Byte magazine. It has its
own forum run by the author, David Betz, and you can turn around a message
to him in 1-2 days. Information on how to sign up has been in most of the
recent issues of Byte. Also, the latest version is 1.7, and there is talk
of a compiler coming out in the future.
John Reece
Intel
------------------------------
Date: Mon, 29 Sep 86 0:30:53 BST
From: Fitch@Cs.Ucl.AC.UK
Subject: OPS5 on small machines (re V4 #183)
There is OPS5 for the IBM-PC running UOLISP, from North West Computer
Algorithms. It is the franz version slightly modified.
I have run OPS5 on an Atari and on an Amiga. It does not need a very big
system to do some things.
==John Fitch
------------------------------
Date: Mon 29 Sep 86 15:40:24-CDT
From: Charles Petrie <AI.PETRIE@MCC.COM>
Reply-to: Petrie@MCC
Subject: TMS Query Response
More detail on Don Rose's TMS query:
Does anyone know whether the standard algorithms for belief revision
(e.g. dependency-directed backtracking in TMS-like systems) are
guaranteed to halt? That is, is it possible for certain belief networks
to be arranged such that no set of mutually consistent beliefs can be found
(without outside influence)?
There are at least three distinct Doyle-style algorithms. Doyle's doesn't
terminate on unsatisfiable cicularities. James Goodwin's algorithm
does. This algorithm is proved correct in "An Improved Algorithm for
Non-monotonic Dependency Net Update", LITH-MAT-R-82-23, Linkoping
Institute of Technology. David Russinoff's algorithm not only halts
given an unsatisfiable circularity, but is guaranteed to find a
well-founded, consistent set of status assignments, even if there are
odd loops, if such a set is possible. There are dependency nets for
which Russinoff's algorithm will properly assign statuses and Goodwin's
may not. An example and proof of correctness for this algorithm is
given in "An Algorithm for Truth Maintenance", AI-068-85,
Microelectronics and Computer Technology Corporation. Also, Doyle made
the claim that an unsatisfiable circularity can be detected if a node is
its own ancestor after finding a valid justification with a NIL status
in the Outlist. Detection of unsatisfiable circularities turns out to be
more difficult than this. This is noted in "A Diffusing Computation for
Truth Maintenance" wherein I give a distributed computation for status
assignment (published in the Proc. 1986 Internat. Conf. on Parallel
Processing, IEEE) that halts on unsatisfiable circularities.
The term "unsatisfiable circularity" was introduced by Doyle and refers
to a dependency network that has no correct status labeling. The term
"odd loop" was introduced by Charniak, Riesbeck, and McDermott in
section 16.7 of "Artificial Intelligence Programming". An equivalent
definition is given by Goodwin. In both, an odd loop refers to a
particular circular path in a dependency net. As Goodwin notes, such
odd loops are a necessary, but not sufficient, condition for an unsatisfiable
circularity.
All of the algorithms mentioned above are for finding a proper set of
status assignments for a dependency network. A distinct issue is the
avoidance of the creation of odd loops, which may introduce
unsatisfiable circularities, by Doyle-style dependency-directed
backtracking. Examples of creation of such odd loops and algorithms to
avoid such are described in my technical reports on DDB. Michael
Reinfrank's report on the KAPRI system also notes the possibility of
odd loops created by DDB. (DDB references on request to avoid an even
longer note.)
Charles Petrie
PETRIE@MCC
------------------------------
Date: 3 Oct 1986 13:36:55 EDT
From: David Smith <DAVSMITH@A.ISI.EDU>
Subject: Computer Vision
Peter Snilovicz recently asked about recognizing faces. I saw a really
interesting presentation on the subject Cortical Thought Theory by Rick Routh,
ex-AFIT now with the Army at Fort Gordon. He can be reached at (404)791-3011.
------------------------------
End of AIList Digest
********************
