LAWS@SRI-AI.ARPA (01/29/85)
From: AIList Moderator Kenneth Laws <AIList-REQUEST@SRI-AI.ARPA>
AIList Digest Tuesday, 29 Jan 1985 Volume 3 : Issue 10
Today's Topics:
Requests - AI and Chemistry & Symbolics Mailing List,
AI Tools - Tree Display & MACSYMA & PSL & Kurzweil's Reader,
Symbolic Algebra - Newsgroup & Contest,
Pattern Recognition - Bird Counting,
News - Recent Articles & Rog-O-Matic,
Logic Programming - Tablog,
Seminar - Philosophy and AI (MIT)
----------------------------------------------------------------------
Date: Mon 28 Jan 85 15:53:39-PST
From: Takashi Okada <OKADA@SUMEX-AIM.ARPA>
Subject: AI and Chemistry
I am interested in the AI application to chemistry and currently
searching a postdoctoral position in universities. Any informations
about the research group in this field will be very much appreciated.
Thanks in advance.
Takashi Okada ( OKADA@SUMEX.ARPA )
Dept. of Chemistry, U.C.Santa Cruz, Santa Cruz, CA 95064
------------------------------
Date: Mon, 28 Jan 85 12:16 EST
From: Tim Finin <Tim%upenn.csnet@csnet-relay.arpa>
Subject: Symbolics Mailing List
Does anyone know of a network mailing list for users of Symbolics Lisp
machines? I'm looking for something like the mailing list that exists for
users of the Xerox 1100 series. I would like a place to interact with a
large community of users of Symbolics machines.
------------------------------
Date: Mon 28 Jan 85 11:18:41-PST
From: PORTA@USC-ECL.ARPA
Subject: Displaying Tree Structures
Regarding your request for a program to display a tree structure with
labeled nodes:
Eve Longini Cohen, formerly with our group at the Jet Propulsion
Laboratory, developed such a program at Carnegie-Mellon to display a tree
representing the results of a theorem-prover. She modified it for us so that
it would display the results of our diagnoser and our planner. (I may not
have all of the history correct, but I know the program plots trees.) We still
have Interlisp code for it. Another group at JPL has a Symbolics Zetalisp
version. If you're interested in any of these programs, Eve's Arpanet address
is ecohen@aerospace and mine is porta@usc-ecl. The group with the Zetalisp
version has no connection to the Arpanet, but you may reach one member, Eric
Biefeld, by telephone at (818) 354-0565.
Harry J. Porta
M.S. 201-203
Jet Propulsion Laboratory
California Institute of Technology
4800 Oak Grove Drive
Pasadena, California 91109
------------------------------
Date: Monday, 28-Jan-85 19:31:07-GMT
From: MACCALLUM QM (on ERCC DEC-10) <MAHM%edxa@ucl-cs.arpa>
Subject: Recent queries in AI List
Re: Symbolic Algebra package request (vol 2 #184)
MACSYMA will run on top of Franz on a VAX. For full details
the person to consult is probably Richard Fateman (Berkeley).
I think Symbolics sell the software at about $1200 for
university users (their commercial price is about 15 times that).
Re: PSL (Kushnier in vol2 #184)
This was developed by Martin Griss and colleagues at Utah, and was
available, when I last heard, for about $250 for the VAX/VMS version.
It can be obtained by writing to
Utah Portable Artificial Intelligence Support Systems Group
Department of Computer Science
3160 MEB
University of Utah
Salt Lake City
UT 84112
(801) 581-5017
and will run under VMS or Unix on a VAX, on DEC-20 and Apollo, and
possibly other machines.
Re: Kurzweil Data Entry Machine
This beast certainly exists. One was demonstrated here (Queen Mary
College, University of London, UK) during a display of computers
for use in the Arts Faculty. I believe it belongs to the Oxford
University Computing service, and is available for users in the UK
from outside Oxford.
Malcolm MacCallum (MMaccall@Ucl-cs.ARPA)
------------------------------
Date: Mon, 28 Jan 1985 10:08:09 EST
From: AXLER%upenn-1100%upenn.csnet@csnet-relay.arpa
Subject: Symbolic Algebra Newsgroup
I received the following message last fall re the forming of a symbolic
algebra newsgroup. However, despite responding in the affirmative, I have yet
to receive any additional mail on the topic.
[Begin forwarded message]
Return-Path: lseward@Rand-Unix.ARPA
From: Larry Seward <lseward%rand-unix.arpa@csnet-relay.csnet>
Date: 14 Aug 84 10:58:06 PDT (Tue)
Subject: Symbolic Algebra Newsgroup
A new newsgroup (net.math.sym) focusing on symbolic algebra is being formed
on the UUCP/USENET. The group will cover algorithms, applications and
related languages. Currently such issues might be discussed in net.ai,
net.math or net.lang. There are 3 algebra systems available under UNIX:
REDUCE, MACSYMA or MAPLE, all of which will be applicable to the newsgroup.
This message is being sent to REDUCE users with a known network address.
Although the newsgroup will be a USENET group, a gateway to the ARPANET is
being set up by Jim Purtilo at the University of Illinois. Presumably
this will also allow access to BITNET and CSNET.
If you would like to be included in such a group, please reply directly to
Laurence Leff (..!decvax!allegra!convex!smu!leff), or me if you have
difficulty reaching that address. If you will be re-distributing the news
locally, or if there are others at your site interested in the group, please
include a count of them.
Larry Seward
[End forwarded message]
Dave Axler
------------------------------
Date: Fri 25 Jan 85 20:36:55-PST
From: Douglas Galbraith <GALBRAITH@SU-SIERRA.ARPA>
Subject: $20 to the first person ...
[Forwarded from the Stanford bboard by Laws@SRI-AI.]
I will pay $20 to the first person to send me the INVERSE Laplace Transform
of this equation:
1 2
F(S) = --- * ----------------------------------
S exp[-A*sqrt(S)] + exp[A*sqrt(S)]
where "A" is a real constant and "S" is the variable.
Thanks,
Douglas Galbraith
galbraith@sierra
doug@helens
------------------------------
Date: Fri 25 Jan 85 08:30:06-PST
From: Nils Nilsson <NILSSON@SU-SCORE.ARPA>
Subject: Computers and Birds
[Forwarded from the Stanford bboard by Laws@SRI-AI.]
Here's a possibly interesting project for "birders"
COLLABORATION SOUGHT ON COMPUTER ANALYSIS OF BIRD SONGS
We would like to develop a system for determining the number of
different species (kinds) of song birds present in an area from
"shotgun" recordings of the singing of the entire avian community.
The basic problem is to develop programs that can estimate how many
kinds of songs there are on a 45 minute sound tape, even though the
songs partially overlap one another, show some variation from
individual to individual, and there is no "library" of known songs to
use for comparisons.
An exact count is not required. We wish to be able to determine
whether one patch of tropical forest had, say, 140-160 species present
when another had only 35-50. We want, in essence, to use tape
recorders in the field to substitute for highly trained ornithologists
when doing surveys of bird diversity. This work is part of a project
of Stanford's CENTER FOR CONSERVATION BIOLOGY in evaluating the
"health" of tropical forest ecosystems.
The project is at present unsupported. Rewards would be working on a
biologically (and perhaps computationally) interesting problem that
has immediate importance to today's environmental crisis and, we hope,
glory in the form of publication(s). If you are interested, please
call:
Paul R. Ehrlich, Department of Biology, Stanford (415) 497-3171
or
John Harte,Energy and Resources Program, Berkeley (415) 642-8553
------------------------------
Date: Sun, 27 Jan 85 05:26:39 cst
From: Laurence Leff <leff%smu.csnet@csnet-relay.arpa>
Subject: Recent Articles
Electronic News, December 31, 1984 page 18
Lisp Machine Incorporated received $7.6 million in third round of financing.
Electronic News, January 14, 1985, page 47
International Robomation/Intelligence has received $2 million in additional
financing from Garrett Corporation.
------------------------------
Date: 27 Jan 85 16:28:14 EST
From: Jon.Webb@CMU-CS-IUS2
Subject: Rog-o-matic makes Scientific American
[Forwarded from the CMU bboard by Laws@SRI-AI.]
The "Computer Recreations" column in this month's Scientific American
discusses Rogue and Rog-o-matic.
------------------------------
Date: 25 Jan 85 1635 PST
From: Yoni Malachi <YM@SU-AI.ARPA>
Subject: Tablog
[Forwarded from the Prolog Digest by Laws@SRI-AI.]
Tablog (Tableau Logic Programming Language) is a language
based on first-order predicate logic with equality that
combines functional and logic programming.
A program in Tablog is a list of formulas in a first-order
logic (including equality, negation, and equivalence). Tablog
programs may define either relations or functions.
Tablog employs the Manna-Waldinger deductive-tableau proof
system as an interpreter in the same way that Prolog uses a
resolution-based proof system. Unification is used by Tablog
to match a call with a line in the program and to bind
arguments. The basic rules of deduction used for computing are
nonclausal resolution and rewriting by means of equality and
equivalence.
A previous message by Uday Reddy (U-REDDY@UTAH-20) classified
Tablog together with Eqlog and Kornfeld's work. There are
however important differences between the three languages:
Kornfeld extends unification to unify expressions declared to
be equal but his system will not reduce a term into other term
defined to be equal to it. Eqlog is an extension of OBJ1 to
use narrowing rather than simple pattern matching when trying
to reduce functional terms.
Tablog, on the other hand, uses standard unification. It
operates on both formulas and terms and uses different inference
rules to reduce them. An atomic formula is reduced using
nonclausal resolution or is rewritten if it is asserted to be
equivalent to another formula. A term gets rewritten using an
equality rule that is applied to the goal to be reduced and
an assertion in the program. This rule is a generalization of
paramodulation.
Tablog distinguishes between negation and failure, so in a
sense it has 3-value logic. Tablog is strictly first-order so
it does not allow higher order functions.
References:
Y. Malachi, Z. Manna, and R. Waldinger,
``TABLOG -- The Deductive Tableau Programming Language,''
Proceedings of the ACM Symposium on Lisp and Functional
Programming, Austin, Texas, August 1984.
Also available as:
Stanford Computer Science Technical Report No. STAN-CS-1012.
(Contact Berg@SCORE for ordering information)
-- Yoni Malachi
------------------------------
Date: Mon 28 Jan 85 18:06:37-EST
From: David Kirsh <KIRSH%MIT-OZ@MIT-MC.ARPA>
Subject: Seminar - Philosophy and AI (MIT)
[Forwarded from the MIT bboard by JCMA@MIT-MC.]
WHY PHILOSOPHY MIGHT MATTER TO AI
DATE: Tuesday, January 29th
TIME: 2:30 PM
PLACE: 8th Floor Playroom
In the 20th century, philosophers have made significant advances
toward understanding the nature of our higher mental abilities. Since
AI is the science of designing possible minds and mind parts, it would
be a surprise if philosophy were not relevant to AI. Questions of the
form "What must a person know if he is to be able to: understand a
language; make valid inductive inferences; explain the occurrence of
a physical event; rationally choose his next action..." are
characteristic of modern philosophy, and not surprisingly philosophers
have their theories. I hope to convince you that philosophers often
ask good questions; they have useful formulations of the terms of
certain AI problems; and they have partial solutions to some of these
problems.
David Kirsh
------------------------------
End of AIList Digest
********************