Copy Link
Add to Bookmark
Report

AIList Digest Volume 8 Issue 114

eZine's profile picture
Published in 
AIList Digest
 · 15 Nov 2023

AIList Digest           Thursday, 27 Oct 1988     Volume 8 : Issue 114 

Queries:

Prolog for 4-D
Representation of biological systems
Poetry composing programs (and 2 responses)
Software for teaching AI techniques
Functions for heuristics (Genetic Algorithms) (and 1 response)
Temporal reasoning
ES for Scheduling Flexible Manufacturing Systems
Canadian AI Magazine: Request for French Translators
ES builders for the IBM PC
Flight Simulation

Responses:

C-Linkable Expertshells (4 messages)
ES in weather forcasting
Daryl Pregibon's address
Common LISP Src for Tomita Algorithm
PFL

----------------------------------------------------------------------

Date: 17 Oct 88 14:56:18 GMT
From: mnetor!utzoo!utgpu!jarvis.csri.toronto.edu!me!ecf!soosaar@uunet.
uu.net (Robert Soosaar)
Subject: Prolog for 4-D

I am currently looking for a good/any Prolog that runs on the
SGI 4-D series machines.

Any comments from users would be appreciated, especially Mprolog by
Logicware.

Rob Soosaar
soosaar@ecf.toronto.edu

------------------------------

Date: 19 Oct 88 16:17 +0800
From: Ulises Cortes <mcvax!fib.upc.es!ia@uunet.UU.NET>
Subject: Representation of biological systems

Our AI group is dealing with the representation of
byological systems. Is anybody out there working in
this field. Actually, we are working with the representation
of an ecosystem (Medas' Islands).

We're looking for people to interchange information and/or
experiences.

Ulises Cortes
Computer Science School
Barcelona. Spain.

------------------------------

Date: 22 Oct 88 20:40:42 GMT
From: bpa!cbmvax!vu-vlsi!lehi3b15!lafcol!chaudhas@rutgers.edu
(Chaudhary Sharad )
Subject: Poetry composing programs

I'm a novice prolog programmer and as a semester project I'm writing
a prolog program that composes simplistic verse. I'm not familiar with
the literature in this field and would appreciate pointers to the
relevant literature. I'm also interested in the more general area
of natural language generators (particularly those written in prolog)
and any references to this field too would be very useful.

Thanks in advance
sharad

------------------------------

Date: 23 Oct 88 16:53:50 GMT
From: glacier!jbn@labrea.stanford.edu (John B. Nagle)
Subject: Re: poetry composing programs


I once generated poetry using 1940's vintage IBM plugboard-wired
accounting machines. This was back in the 1960s, when computer time was
harder to come by. I used an IBM 85 collator, a 402 accounting machine,
and an 82 sorter. The basic technique involved imposing the grammatical
pattern of an existing poem on random words. Some additional checks
insured that the word-to-word transitions were similar to ones that had
appeared in other text.

The result was not particularly profound, but read well in spots.

John Nagle

------------------------------

Date: 25 Oct 88 02:18:59 GMT
From: apple!well!jax@rutgers.edu (Jack J. Woehr)
Subject: Re: poetry composing programs

In article <288@lafcol.UUCP> chaudhas@lafcol.UUCP (Chaudhary Sharad ) writes:
>I'm a novice prolog programmer and as a semester project I'm writing
>a prolog program that composes simplistic verse. I'm not familiar with
>the literature in this field and would appreciate pointers to the
>relevant literature. I'm also interested in the more general area
>of natural language generators (particularly those written in prolog)
>and any references to this field too would be very useful.
>
> Thanks in advance
> sharad

How about a Forth program that composes Chinese Limericks?
See _Forth Notebook_ by Dr. C.H.Ting, Offete Enterprises, 1987
pp. 245 - 250.

( Offete Enterprises in 1306 South B Street, San Mateo, CA 94402)

Dr. Ting has also implemented a tiny Prolog in Forth called Forlog.


{}{}{}{}{}{}{}{}{}{}{}{}{}{}{}{}{}{}{}{}{}{}{}{}{}{}{}{}{}{}{}{}{}{}{}{}{}{}
{} {}
{} jax@well ." Sysop, Realtime Control and Forth Board" {}
{} jax@chariot ." (303) 278-0364 300/1200 8-n-1 24 hrs." {}
{} JAX on GEnie ." Tell them JAX sent you!" {}
{} {}
{}{}{}{}{}{}{}{}{}{}{}{}{}{}{}{}{}{}{}{}{}{}{}{}{}{}{}{}{}{}{}{}{}{}{}{}{}{}

------------------------------

Date: Sat, 22 Oct 88 17:17 EST
From: steven horst
<GKMARH%IRISHMVS.BITNET@MITVMA.MIT.EDU>
Subject: Software for teaching AI techniques

I am teaching a course on AI for Arts & Letters undergrads
this spring semester, and should appreciate suggestions on freeware
or inexpensive software that is useful for teaching basic AI concepts
and techniques. The course is NOT primarily a PROGRAMMING course,
and some students may actually have no progamming background at all.
The time allocated for introducing AI techniques, moreover, is
limited to a maximum of about 8 sessions, because the course covers
philosophical issues and technology and society questions as well.
(In other words, teaching LISP or Prolog is pretty much out of
the question.)

Since concepts like semantic networks, frames and feedback loops and
techniques like backward chaining are language-independent, I have
some hope that either (a) someone has developed some good educational
software for teaching AI concepts and techniques to people who don't
use LISP or Prolog, or (b) something on the order of an expert
systems shell might be easily adaptable to educational ends.

I should appreciate suggestions on good freeware or commercial
software that can be bought or licenced at a low price. Applications
that run on the Macintosh would be of particular interest, as my
university has become highly Mac-oriented.

I should also be interested in hearing other people's experiences in
trying to put together a broad introduction to AI for undergraduates
who are NOT specializing in an area closely related to AI (computer
science, cognitive psychology, logic, &c.)

Thank you in advance.

*****************************************************
* Steven Horst Bitnet: gkmarh@irishmvs *
* Department of Philosophy 219-239-7458 *
* Notre Dame, IN 46556 *
*****************************************************

------------------------------

Date: 24 Oct 88 05:17:12 GMT
From: apple!bionet!agate!pasteur!cory.Berkeley.EDU!carasso@bloom-beaco
n.mit.edu (George of the Jungle)
Subject: functions for heuristics (Genetic Algorithms)


I was interested in designing an experimental program, where the program
would try to solve a problem by using various heuristics. What I would like
to do is model it after evolution. If a heuristic is successful,
then it creates mutant heuristic versions of itself, and then those
heuristics are put to the test, et cetera. Each time, the ones that
solve the problem in the shortest time are allowed to have children,
others are "terminated".

In wanting mutant children created, I do not simply want to change
some constants in the parent's fuctions, but rather would like it to
change the function itself and create totally new ones. In starting this
off, I also do not want to enter the base case for all the fuctions I know.
For example \x. x*x; or \x. c; or \x. x^x; or what ever fuction I could dream
up. Is there any way to create "all function groups", within reason?
Where two functions are in the same group if they differ by a constant,
or number of repeatitions.

Of course, the eventual goal is to see the program find a good heuristic
on its own.

Roger Carasso,
UCB


"My ignorance is my own, and is no way related to any organization"

------------------------------

Date: 24 Oct 88 21:57:38 GMT
From: nau@mimsy.umd.edu (Dana S. Nau)
Subject: Re: functions for heuristics

In a previous article, George of the Jungle writes:
>I was interested in designing an experimental program, where the program
>would try to solve a problem by using various heuristics. ... If a heuristic
>is successful, then it creates mutant heuristic versions of itself, and then
>those heuristics are put to the test, et cetera. ...

Ping-Chung Chi has done a nice Ph.D. dissertation at the University of
Maryland, studying game tree searching. Among other things, he has done
the above on game trees using a genetic algorithms approach. For more
information, write to chi@mimsy.umd.edu.
--
Dana S. Nau
Computer Science Dept. ARPA & CSNet: nau@mimsy.umd.edu
University of Maryland UUCP: ...!{allegra,uunet}!mimsy!nau
College Park, MD 20742 Telephone: (301) 454-7932

------------------------------

Date: Tue, 25 Oct 88 09:31 CDT
From: ANDERSJ%ccm.UManitoba.CA@MITVMA.MIT.EDU
Subject: temporal reasoning

I am currently doing research into temporal reasoning methods. I have
gathered a great deal of material on classic general methods, but
what I require is any references to temporal reasoning methods used
by various medical AI systems. Any info anyone could give me would
be greatly appreciated
John Anderson
<ANDERSJ@UOFMCC.BITNET>

------------------------------

Date: Tue, 25 Oct 88 10:32 CDT
From: <A0J5791%TAMSTAR.BITNET@MITVMA.MIT.EDU>
Subject: ES for Scheduling Flexible Manufacturing Systems

Hi!... I am compiling a survey of expert systems for scheduling CIM in general
and FMS in particular. I would appreciate views/comments from persons in academi
a and industry, who are involved in developing/using such systems. I am
particularly interested in the limitations and effectiveness of these expert
systems, and what role a human scheduler would play in the highly complex
and constantly evolving environment of FMS. Does anyone know if ISIS still
being used at Westinghouse? I would welcome comments from U.S. and the
worldwide readers of the AILIST DIGEST.
Arshad Jamil
Graduate student
Department of Industrial Engineering
Texas A&M University, College Station, TX 77843

------------------------------

Date: 25 Oct 88 12:35 -0600
From: Christopher G Prince <prince%noah.arc.cdn@relay.ubc.ca>
Subject: Canadian AI Magazine: Request for French Translators

Canadian Artificial Intelligence (a publication of the Canadian Society
for Computational Studies of Intelligence) translates abstracts of
articles and some whole articles into french language.

We are in need of extra translators. These people should have computer
science background with at least some knowledge of AI terminology, and
be able to do french translation.

Any help would be appreciated.

[The deadlines for the comming issues:
November 15, 1988
February 15, 1989
May 15, 1989
August 15, 1989]

For responses to this message, please send email to me:


Christopher G. Prince
Alberta Research Council,
6815 8th Street NE, 3rd Floor
Calgary, Alberta, CANADA T2E 7H7
(403) 297-2600

UUCP: chris%arcsun.uucp%ubc.csnet@relay.cs.net
or prince%noah.arc.cdn@alberta.uucp
or ...!ubc-cs!calgary!arcsun!chris
CDNnet: prince@noah.arc.cdn


For Content and Submission requests:


Canadian AI Magazine
C/O Alberta Research Council,
6815 8th Street NE, 3rd Floor
Calgary, Alberta, CANADA T2E 7H7
(403) 297-2600

UUCP: cscsi%arcsun.uucp%ubc.csnet@relay.cs.net
or cscsi%noah.arc.cdn@alberta.uucp
or ...!ubc-cs!calgary!arcsun!cscsi
CDNnet: cscsi@noah.arc.cdn

Subscription Requests:


CIPS
243 College Street (5th floor),
Toronto, Ontario, CANADA
M5T 2Y1

------------------------------

Date: 26 Oct 88 12:41:56 GMT
From: izimbra!dsc@uunet.uu.net (David S. Comay)
Subject: ES builders for the IBM PC

i'm looking for information and/or recommendations on expert system
builders for the ibm pc and compatibles. the application will be a
`small' consultation-based expert system (on the order of a hundred
rules) and though i have heard of these three products out there, i
know little more about them or any others: ti's pc personal consultant,
vp-expert & the level5 system.

i would appreciate any information and or opinions on these products or
others out there that might fit the bill.

thanks for the help,

dsc

------------------------------

Date: 26 Oct 88 15:23:48 GMT
From: mailrus!ulowell!masscomp!daved@ohio-state.arpa (Dave Davis)
Subject: Flight Simulation

I'm looking for articles, proceedings and perhaps textbooks that discuss
the role of ai in flight simulators. I have seen citations for Rolfe's
book (a college text), but I haven't laid hands on a copy yet. I would
be particularly interested in looking at anything that discusses the role
of computer architectures for ai applications in flight simulation.

Thanks in advance.

Dave Davis

------------------------------

Date: 20 Oct 88 20:31:59 GMT
From: pioneer.arc.nasa.gov!raymond@ames.arpa (Eric A. Raymond)
Subject: Re: C-Linkable Expertshells


CLIPS is NASA's shell:
- built in C
- can turn rules into C (if desired)
- comes with full source
- a subset of ART (Inference Corp.)
- nice integrated environment for Mac
- extremely portable
- fast
- low memory requirements (relative to other systems)
- cheap ($250 for public, free for government)

Available from COSMIC (404) 542-3265

Name: Eric A. Raymond
ARPA: raymond@pioneer.arc.nasa.gov
SLOW: NASA Ames Research Center, MS 244-17, Moffett Field, CA 94035

Nothing left to do but :-) :-) :-)

------------------------------

Date: 21 Oct 88 20:05:51 GMT
From: portal!cup.portal.com!TechServices@uunet.uu.net (Angelo C
Micheletti)
Subject: Re: C-Linkable Expertshells

Neuron Data's NEXPERT OBJECT is not only written in C but
is completely embeddable in YOUR application program and
runs on IBM AT/PS2, Mac, Vax, HP, Sun, Appolo and has the
same look on each. Be happy to furnish more information
if you'll let me know.

------------------------------

Date: 24 Oct 88 03:33:04 GMT
From: wucs1!slustl!patnaik@uunet.uu.net (Gagan Patnaik)
Subject: Re: C-Linkable Expertshells

In article <852@tnoibbc.UUCP>, sp@tnoibbc.UUCP (Silvain Piree) writes:
>
> Does anyone know any other expertshells that can be integrated with C ?
>

Yes, RuleMaster2 by Radian Corp. is based in C, and produces C and
FORTRAN source codes. Radian Corp. is based in Austin, Texas.

------------------------------

Date: 25 Oct 88 17:45:41 GMT
From: bbking!rmarks@burdvax.prc.unisys.com (Richard Marks)
Subject: Re: C-Linkable Expertshells

In article <852@tnoibbc.UUCP>, sp@tnoibbc.UUCP (Silvain Piree) writes:
>
> Does anyone know any other expertshells that can be integrated with C ?
>

Yes. KES marketed and supported by Unisys. This is a very good product.
It is "industrial strength"; if you have a real number of rules, this is
about the best product we have seen.

It runs quite well on PC's. We have also ported it to several of our Unix
boxes. Work to port it to our mainframes is proceeding. On the PC, it
is integratable with MicroSoft C.

Richard Marks
rmarks@KSP.unisys.COM

------------------------------

Date: Fri, 21 Oct 88 17:35 PST
From: HEARNE%wwu.edu@RELAY.CS.NET
Subject: ES in weather forcasting


REGARDING:

Inquiry about expert systems in weather forcasting. The 1987 NOAA Conference
on Artificial Intelligence Research in Environmental Science at Boulder
Colorado (Sept 15-17) was almost exclusively devoted to expert systems
in weather forcasting. It produced neither proceedings nor a participant
list so the best thing is to write to one of the organizers. The name I
have is Chris Fields, Computing Research Lab, New Mexico State University,
Las Cruces NM 88003-0001

Jim Hearne
Computer Science
Western Washington University
Bellingham WA 98225

------------------------------

Date: Mon, 24 Oct 88 08:58:50
From: GOLUMBIC%ISRAEARN.BITNET@CUNYVM.CUNY.EDU

Date: 24 October 88, 08:37:13 IDT
From: Martin Charles Golumbic 972 4 296282 GOLUMBIC at ISRAEARN
To: AILIST at AI.AI.MIT

Daryl Pregibon's address is:
AT&T Bell Labs 2C-264 email: daryl@research.att.com
600 Mountain Ave. UUCP: ihnp$!alice!daryl
Murray Hill, NJ 07974 U.S.A.


Advanced Registration Forms should be sent to Daryl by December 1, 1988 for
the Second International Workshop on Artificial Intelligence and Statistics
Fort Lauderdale, Florida Jan. 4-7, 1989
Chairman: William Gale (gale@research.att.com)

The papers will be strictly refereed and revised to produce a volume of the
Annals of Mathematics and Artificial Intelligence
as a permanent record of the workshop.

------------------------------

Date: Tue, 25 Oct 88 18:38 EDT
From: Brad Miller <miller@CS.ROCHESTER.EDU>
Reply-to: miller@CS.ROCHESTER.EDU
Subject: Re: Common LISP Src for Tomita Algorithm

Date: 20 Oct 88 02:28:07 GMT
From: sun.soe.clarkson.edu!tree@tcgould.tn.cornell.edu (Tom Emerson)

I am looking for the Common LISP source of Tomita's parsing algorithm and
LR-parse table generator. Any help in this would be greatly appreciated.

Thanx in advance for any help in this matter.

Tom Emerson
LISP Coordinator
SOE Network, Clarkson University
tree@sun.soe.clarkson.edu

We have this version:

(print "**************************************************************
(print "
********
(print "******** LFG Compiler/Parser with the TOMITA parsing algorithm
(print "
********
(print "******** Center for Machine Translation
(print "
******** Carnegie-Mellon University
(print "******** Version 6.9, September 1986
(print "
******** (c) Carnegie-Mellon University, all rights reserved
(print "********
(print "
**************************************************************

so I suggest contacting them for info.

----
Brad Miller U. Rochester Comp Sci Dept.
miller@cs.rochester.edu {...allegra!rochester!miller}

------------------------------

Date: 27 Oct 88 01:12:30 GMT
From: rutgers!prc.unisys.com!finin@ucsd.edu (Tim Finin)
Reply-to: rutgers!prc.unisys.com!finin@ucsd.edu (Tim Finin)
Subject: Re: PFL


The PFL package is also available via anonymous ftp on
linc.cis.upenn.edu in ~ftp/pub/pfl . PFL is a relatively simple
frame-based knowledge representation language implemented in Common
Lisp. Tim

Tim Finin finin@prc.unisys.com
Paoli Research Center ..!{psuvax1,sdcrdcf,cbmvax}!burdvax!finin
Unisys 215-648-7446 (office) 215-386-1749 (home)
PO Box 517, Paoli PA 19301 215-648-7412 (fax)

------------------------------

End of AIList Digest
********************

← previous
next →
loading
sending ...
New to Neperos ? Sign Up for free
download Neperos App from Google Play
install Neperos as PWA

Let's discover also

Recent Articles

Recent Comments

Neperos cookies
This website uses cookies to store your preferences and improve the service. Cookies authorization will allow me and / or my partners to process personal data such as browsing behaviour.

By pressing OK you agree to the Terms of Service and acknowledge the Privacy Policy

By pressing REJECT you will be able to continue to use Neperos (like read articles or write comments) but some important cookies will not be set. This may affect certain features and functions of the platform.
OK
REJECT