LAWS@SRI-AI.ARPA (02/19/85)
From: AIList Moderator Kenneth Laws <AIList-REQUEST@SRI-AI.ARPA>
AIList Digest Tuesday, 19 Feb 1985 Volume 3 : Issue 23
Today's Topics:
AI Tools - PC LISPs & Flavors,
Humor - Polly Nomial,
Information Science - Webster & Xerox Notecards,
Literature - Recent Articles & University of Rochester Reports,
Seminars - Mental Models (UCB) &
Natural Concurrent Grammar (Weitzmann),
Conference - AI in Engineering,
Program Descriptions - Postdocs at NPRDC-UCSD & AI Research at UCLA
----------------------------------------------------------------------
Date: 18 Feb 85 07:39:32 EST (Mon)
From: johnson <johnson@udel-dewey>
Subject: info request pc lisps
I am looking for experiences, comparisons, and evaluations of any
lisp available on PC+compatibles. I am particularly interested in:
TLC [The Lisp Company] Lisp
vs
GC Lisp
vs
IQ Lisp
vs
muLisp.
I am familiar with franz, interlisp, and muLisp - so any comparisons
versus these breeds of lisp would be particularly useful to me.
I am more concerned with efficiency than adherence to standards,
in particular :
1. how long does this take in (X)_lisp:
; use any interation method provided by X
; AVOID recursion if possible
(do-2000-times (cond (T)))
2. how long does this take:
; after : (setq z nil)
(do-2000-times (setq z (cons T z)))
3. Is there a way to remove objects from the object list?
4. Is there an interface to assembly language modules?
(can lisp call machine-lang functions?)
5. How long does it take for (X)Lisp to load and give its first prompt.
[please include a hardware description for sake of comparison]
(eg: 256k IBMXT, PCDOS 2.00, running (X)lisp from fixed disk)
6. Price of (X)lisp and any licensing charges.
please send response directly to me, I will (net-mail) results to
anyone who asks [but wait a few days before asking, ok?]
-thanks in advance.
johnson@udel-ee
... Share a little joke with the World |-> ...
------------------------------
Date: Tuesday, 19-Feb-85 12:20:12-GMT
From: GORDON JOLY (on ERCC DEC-10) <GCJ%edxa@ucl-cs.arpa>
Subject: Flavors
I have come across the term `flavors' several times but still have no
idea what it means. Please could someone explain?
Thanks,
Gordon Joly
gcj%edxa@ucl-cs.arpa
------------------------------
Date: Sun, 17 Feb 85 13:27:30 cst
From: "Duncan A. Buell" <buell%lsu.csnet@csnet-relay.arpa>
Subject: polly nomial
This was printed in a slightly different form (the version from the
network has some updates that actually make it a little better in
my mind) in Scope: Journal of the Federation of University
Astronomical Societies about fifteen years ago. That, at least, is
where I got my copy.
------------------------------
Date: Sun, 17 Feb 85 20:02:11 est
From: davy@purdue-ecn.ARPA (Dave Curry [decvax!pur-ee!davy -or-
davy@purdue-ecn])
Subject: Webster
Regarding the copy of Webster's dictionary on SRI-NIC. I have written
a program for 4.2BSD UNIX which contacts the server on SRI-NIC and
enables the user to "converse" with the dictionary. The source for
this program is available via anonymous FTP from PURDUE-ECN in the
directory "pub/webster". Please note that we have a "part-time" ARPAnet
connection, i.e., we run thrugh the computer center, which has rather
strange hours:
M-F: 8:30am - midnight Sat: noon - 5:00pm Sun: noon - midnight
or something like that. All times are Eastern. The source is also
available in WEB:WEBSTER.C from SRI-NIC, however, this is an old copy of
the source (with a couple of minor bugs), so don't grab it unless you
can't get to us (it should be updated soon).
Also, for you TOPS-20/Tenex folks, there's a Midas source in the file
WEB:WEBSTER.MID (executable is WEB:WEBSTER.EXE) on SRI-NIC (I know
nothing about this one, I just mention it to be complete). As far as I
know from conversing with the folks in charge of this thing, these are
the only two programs available for dealing with Webster. If you have
one for another operating system, send a note to IAN@SRI-NIC. He is
collecting the sources.
--Dave Curry
davy@purdue-ecn
------------------------------
Date: 17 Feb 85 15:54 PST
From: fisher.pasa@XEROX.ARPA
Subject: Xerox Notecards
The Xerox notecards system is presently being licenced to Xerox
1100/1108/1132 customers as a part of special Xerox applications
development programs.
The Xerox notecards system is not a supported product at this time
although discussions are proceeding within the Corporation regarding
that possibility.
Further information can be obtained by messaging me.
Pete Fisher (fisher.pasa@Xerox)
------------------------------
Date: Sat, 16 Feb 85 04:52:03 cst
From: Laurence Leff <leff%smu.csnet@csnet-relay.arpa>
Subject: Recent Articles
IEEE Transactions on Pattern Analysis and Machine Intelligence
January 1985 Volume PAMI-7 Number 1
Parallel Algorithms for Syllable Recognition in Continuous Speech
page 56-69
An Evaluation Based Theorem Prover page 70-79
A mechanical theorem prover applied to proving theorems about programs.
A New Heuristic Search Technique - Algorithm SA page 103-107
A Search Technique based on a statistical sampling technique
Inforworld February 11, 1985 page 13
Lotus Edges into AI
Lotus signed a 1 million dollar venture financing agreement with
Arity computer. The software, promised for late 1985, will be
an integrated business productivity tool for IBM PC's.
------------------------------
Date: Mon, 18 Feb 85 16:01:59 cst
From: Laurence Leff <leff%smu.csnet@csnet-relay.arpa>
Subject: University of Rochester Reports
The University of Rochester
Technical Report List
TR132 Gacs, P "Reliable computation with cellular automata" $2.25
Construction of one-dimensional array of cellular automata which is
self-repairing
TR133 Ballard, D. H. "Cortical connections: Structure and Function" $1.50
TR141 Allen, J. F and D. J. Litman "A plan recognition model for
subdialogues in conversations" $1.50
TR143 D. C. Plaut "Visual recognition of simple objects by a connection
network" $1.25
------------------------------
Date: Tue, 19 Feb 85 09:11:35 pst
From: kuhn%ucbcogsci@Berkeley (Elisabeth Kuhn)
Subject: Seminar - Mental Models (UCB)
BERKELEY COGNITIVE SCIENCE PROGRAM
Spring 1985
Cognitive Science Seminar -- IDS 237B
TIME: Tuesday, February 19, 11:30 - 12:30
(Please note that the talk starts at 11:30 this week)
PLACE: 240 Bechtel Engineering Center
DISCUSSION: 12:30 - 2 in 200 Building T-4
Philip Johnson-Laird, Visiting Professor at Stanford - from MRC
Applied Psychology Unit, Cambridge
``Mental Models''
The aim of this talk is to explore the hypothesis that a major class
of mental representations take the form of models of the world.
Such models contrast with propositional representations, i.e.
syntactically structured strings of symbols in a mental language,
because models are assumed to make explicit the perceived or conceived
relations between things in the world. The explanatory value of models
will be illustrated in three areas: reasoning, comprehension, and
the representation of discourse.
------------------------------
Date: Tue, 19 Feb 85 11:42:19 -0200
From: scheff%wisdom.BITNET@WISCVM.ARPA (scheff chaim)
Subject: Seminar - Natural Concurrent Grammar (Weitzmann)
The Weitzmann Institute of Science - Rehovot, Israel
Seminar in Applied Mathematics and Computer Science
Chaim-Meyer Scheff
will speak on
"Alternatives in Artificial Intelligence: Natural Concurrent Grammar".
The talk will take place on Wednesday, February 27, 1985 in the Feinberg
Building, Room C, at 9:00.
Natural grammer, based on the independent work of Vygotsky and Bitner,
suggest the feasibility of flow through parsing schemes for natural
language; and further suggest applications for seemingly ambiguous
natural language in the programming environment.
Vygotsky grammar removes the structural constraints of transformational
grammar. While Bitner grammar gives formal structure to the otherwise
nondeterministic ambiguity problem.
Further analysis, based on the grammar of American Sign Language, would
replace Bitner's sequential based ambiguity marker set with a set of
vector space markers of generalized function; thereby allowing for viable
models of concurrent cognitive processes; such as those which minimize
transaction flux in Mapless Networks.
------------------------------
Date: Monday, 18 February 1985 05:49:16 EST
From: Duvvuru.Sriram@cmu-ri-cive.arpa
Subject: Conference - AI in Engineering
CALL FOR PAPERS
FIRST INTERNATIONAL CONFERENCE ON APPLICATIONS OF
ARTIFICIAL INTELLIGENCE TO ENGINEERING PROBLEMS
(AIEP)
The purpose of this conference is to provide a forum for
engineers all over the world to present their work on the
applications of artificial intelligence to engineering
problems. The conference will be held from April 15-18 1986
at Southampton University, England and will be preceeded by
tutorials in Expert systems and Robotics.
CONFERENCE THEMES
The following topics are suggested and other related areas
will be considered.
- Computer-aided design
- Computer-based training
- Planning and Scheduling
- Constraint Management
- Intelligent Tutors
- Expert systems
- Knowledge representation
- Learning
- Natural language applications
- Cognitive modelling of engineering problems
- Robotics
- Database interfaces
- Graphical interfaces
- Knowledge-based simulation
- Design Modelling
CALL FOR PAPERS
Authors are invited to submit three copies of a 500 word
abstract. The abstract should have enough details to permit
careful evaluation by a committee consisting of renowed
experts in the field. The abstracts should be accompained
with the following details:
- Authors' address, name, affliation. Indicate the
person to address all correspondence.
- The branch of engineering. If the paper addresses
engineering in general, then should be categorized
under GENERAL DESIGN.
- The topic area.
TIME TABLE
Submission of Abstracts: June 1st 1985
Notification of acceptance: August 1st 1985
Submission of Full Paper: November 1st 1985
INFORMATION
All abstracts should be sent to:
Dr. R. Adey, General Chairman, AIEP
Computational Mechanics Centre
Ashurst Lodge
Southampton S04 2AA
England
Inquires about exhibits, registration should be addressed
to:
Ms Elaine Taylor
Computational Mechanics Centre
Ashurst Lodge
Southampton S04 2AA
England
For more information in US contact:
D. Sriram, Technical Chairman AIEP
Civil Engineering and Construction Robotics
Laboratories
Department of Civil Engineering
Carnegie-Mellon University
Pittsburgh, PA 15213
sriram@cmu-ri-cive.arpa
------------------------------
Date: Wednesday, 13 February 1985, 10:07-PST
From: Jim Hollan <hollan@nprdc>
Subject: Postdocs
This note is to announce the formation of a new collaborative
research group: the NPRDC-UCSD Intelligent Systems Group (ISG). ISG is
concerned with addressing basic research questions involving intelligent
graphical interfaces, computational accounts of cognition, knowledge
representation, human machine interaction, and elicitation of expert
knowledge. The group has excellent computational facilities. Currently
this includes four Symbolics lisp machines, two Xerox Dandy-Tigers, a Xerox
Dorado, and arpanet access via central Vax computers. The Institute for
Cognitive Science, of which ISG is a member, has a network of 15 SUN
workstations and a Vax.
A number of post-doctoral fellowships are available for recent
cognitive science or artificial intelligence PhDs. Fellowships are for
two-years with an option of a third year. Stipend is approximately
30K/year with an additional allowance of 6K for relocation and
professional travel. The postdoctoral fellowships come from ONR (Office
of Naval Research). Fellows will work in ISG on the UCSD campus.
Interested applicants should communicate with James D. Hollan or Donald
A. Norman, Intelligent Systems Group; Institute for Cognitive Science
C-015; University of California, San Diego; La Jolla, CA 92093. Arpanet
addresses: hollan@nprdc or norman@nprdc.
------------------------------
Date: Fri, 15 Feb 85 06:28:35 PST
From: Judea Pearl <judea@UCLA-LOCUS.ARPA>
Subject: AI Research at UCLA
[Edited by Laws@SRI-AI.]
The UCLA Computer Science Department is actively researching in all areas
of Artificial Intelligence, with increasing interest in: robotics &
vision, learning & memory, qualitative reasoning & expert systems,
planning and automatic programming.
Current AI research at UCLA is most focussed in the areas of natural
language processing, cognitive modeling, the analysis of
heuristics and evidential reasoning. Projects include editorial
comprehension, story invention, legal reasoning, intelligent tutoring,
learning through planning, discovery of heuristics, and distributed
inferencing.
Facilities for AI research at UCLA consist of a ring network of Apollo
workstations, which comprises one of the largest Apollo
installation sites in Southern California. Each Apollo workstation
consists of 1.5-4 Mbyte main memory, multi-processing operating
system with multi-windowing, font editing, and SIGGRAPH Core
graphics primitives. Networking is built into each workstation.
Our AI tools environment, called GATE (Graphical AI Tools Environment),
is built on top of T, a lexically-scoped, Scheme-based dialect of Lisp
developed at Yale University. T, designed for efficient implementation
and execution, incorporates object-oriented programing with
message-passing semantics as its most fundamental language construct.
GATE includes a number of interacting packages: Flavors, DELON -- a
language for specifying demons and traps, WEBs -- a slot-filler system
for specifying semantic memories represented by graphical icons
connected by rubberband links, and TLOG -- a logic programming
system which allows both Prolog and T style syntax.
In addition to the Apollos, the CS department maintains a network of 20
Vaxes, which communicate with the Apollo ring via an ethernet gateway.
For more information contact:
Prof. Judea Pearl,
4731E Boelter hall, UCLA, Los Angeles, CA 90024
(judea@UCLA-CS.arpa)
Prof. Michael Dyer,
3532 Boelter Hall, UCLA, Los Angeles, CA 90024
(dyer@UCLA-CS.ARPA).
Prof. Margot Flowers
3532 Boelter Hall, UCLA, Los Angeles, CA 90024
(flowers@UCLA-CS.ARPA)
------------------------------
End of AIList Digest
********************