Copy Link
Add to Bookmark
Report
AIList Digest Volume 2 Issue 073
AIList Digest Friday, 15 Jun 1984 Volume 2 : Issue 73
Today's Topics:
AI Programming - Definition,
Scientific Method - Mathematics,
AI Reports - Recent Titles,
Forum - Minsky and Asimov at Rensselaerville,
Seminars - Motion of Objects in Contact & AI and APL &
Learning Equation Solving Methods,
Workshops - Expert Systems & Reasoning
----------------------------------------------------------------------
Date: 9 Jun 84 14:06:55-PDT (Sat)
From: hplabs!hao!seismo!cmcl2!floyd!clyde!burl!ulysses!gamma!exodus!dhc
@ Ucb-Vax.arpa
Subject: Re: Definition of an AI program
Article-I.D.: exodus.169
In-Reply-To: Article <581@sri-arpa.UUCP>
How about this:
A program is an AI program if and only if it is written in LISP.
David H. Copp
[Or Prolog? The "if ..." is commonly assumed, but the "only if ..."
seems much too strong. I currently do list processing in C; while
I don't claim much AI content, I see little difference between the C
code and equivalent algorithms written in LISP. Bob Amsler has pointed
out to me that spelling correctors are knowledge-based programs capable
of outperforming even intelligent humans; few such programs are written
in AI languages. -- KIL]
------------------------------
Date: Wednesday, 13-Jun-84 16:33:08-BST
From: BUNDY HPS (on ERCC DEC-10) <Bundy%edxa@ucl-cs.arpa>
Subject: Mathematical Methods
I support Broome's and Brint's interpretations of what I was
trying to say in my book. I was not trying to criticise mathematics
papers per se, but to point out that they do not contain some of the
information that AI researchers need for computational modelling and to
make a plea for a forum for such information.
But let me add a caveat to that. The proofs in a paper are at
least as important a contribution to mathematics as the theorems they
prove. Future mathematicians may want to use these proofs as models for
proofs in analogous areas of mathematics (think of diagonalization
arguments, for instance). So it will improve the MATHEMATICAL content
of the papers if the author points out the structure of the proof and
draws attention to what s/he regards as the key ideas behind the proof.
Alan Bundy
------------------------------
Date: 12 Jun 84 20:27:32-PDT (Tue)
From: hplabs!hao!seismo!rochester!sher @ Ucb-Vax.arpa
Subject: Re: Mathematical Methods
Article-I.D.: rocheste.7379
Personally, I have done mathematics up to the beginning graduate level
for various courses. When I do any difficult piece of mathematics I
find that after the fact I can never remember how I came upon the
proof. I can reconstruct my steps but the reconstruction has no real
relationship to what I really did. The sensation of finishing a proof
is highly analogous to waking up from a dream. This is possibly the
most important reason why I am doing artificial intelligence rather
than mathematics today. If other real mathematicians also operate in
this manner then it is not surprising that they are reluctant to write
up their reasoning processes. They literally cannot remember them.
-David
------------------------------
Date: Sun 10 Jun 84 13:26:20-PDT
From: Chuck Restivo <Restivo@SU-SCORE>
Subject: LP - Library Update
[Forwarded from the Prolog digest by Laws@SRI-AI.]
Isaac Balbin and Koenraad Lecot sent a copy of their
useful publication;
"Prolog and Logic Programming Bibliography"
The cost for obtaining your own copy is $5.00 Australian,
and includes the cost of Air Mail.
Contact:
Isaac Balbin
Department of Computer Science
Parkville 3052
Melbourne, Australia
Send information regarding new references and errata to
UUCP: {decvax}, vax135} !mulga!Isaac
or
ARPA: CS.Koen@UCLA-Locus
so the bibliography can be updated regularly, please.
[...]
------------------------------
Date: Wed 13 Jun 84 19:27:42-PDT
From: Dikran Karagueuzian <DIKRAN@SU-CSLI.ARPA>
Subject: AI Reports
[Forwarded from the CSLI Newsletter by Laws@SRI-AI.]
Partial New Reports List
MATH & COMPUTER SCIENCE LIBRARY
(From Vol. 6, No. 6, 05/28/84)
The reports listed below are now available for circulation at Stanford.
019257 Haridi, S. Sahlin, D.*Evaluation of logic programs based on
natural deduction.* Royal Inst. of Tech., Stockholm.
Telecomm. & Comp. Systems Dept.*TRITA-CS-8305 B.*1983.
019261 Gendrix, G.G. Lewis, W.H.* Transportable natural language
interfaces to databases.* SRI International. A.I. Center.*
Tech.Note 228.*1981.
019263 Walker, D.E. Hobbs, J.R.* Natural language access to
medical text.* SRI International. A.I. Center.*Tech.Note
240.*1981.
019264 Pereira, F.* Logic for natural language analysis.* SRI
International. A.I. Center.*Tech.Note 275, Ph.D. Thesis.
Pereira, F.*1983. (Slightly revised version of a thesis
submitted to the Department of Artificial Intelligence,
University of Edinburgh for the degree of Doctor of
Philosophy).
019271 Moore, R.C.* Semantical considerations on nonmonotonic
logic.* SRI International. A.I. Center.*Tech.Note 284.*
1983.
019272 Uszkoreit, H.*A framework for processing partially free
word order.* SRI International. A.I. Center.*Tech.Note
285.*1983.
019277 Warren, D.H.D.* Applied logic - its use and implementation
as a programming tool.* SRI International. A.I. Center.*
Tech.Note 290, Ph.D. Thesis. Warren, D.H.D.*1983.
(Verbatim copy of a thesis submitted to the Department of
Artificial Intelligence, University of Edinburgh in 1977
for the degree of Doctor of Philosophy).
019278 Shieber, S.M.* Direct parsing of ID/LP grammars.* SRI
International. A.I. Center.*Tech.Note 291R.*1983
(revised).
019279 Grosz, B.J. Joshi, A.K. Weinstein, S.*Providing a unified
account of definite noun phrases in discourses.* SRI
International. A.I. Center.*Tech.Note 292.*1983.
019280 Martin, P. Appelt, D. Pereira, F.* Transportability and
generality in a natural language interface system.* SRI
International. A.I. Center.*Tech.Note 293.*1983.
019292 Pereira, F.C.N. Warren, D.H.D.* Parsing as deduction.* SRI
International. A.I. Center.*Tech.Note 295.*1983.
019284 Appelt, D.E.* Telegram: a grammar formalism for language
planning.* SRI International. A.I. Center.*Tech.Note 297.*
1983.
019290 Appelt, D.* Planning English referring expressions.* SRI
International. A.I. Center.*Tech.Note 312.*1983.
019294 Nilsson, N.J.* Probabilistic logic.* SRI International.
A.I. Center.*Tech.Note 321.*1984.
019308 Meandzija, B.*Automated generation of communication
systems.* Southern Methodist U. Comp.Sci. & Eng.Dept.*
83-CSE-16.*1983.
019319 Griswold, R.E.*The implementation of an experimental
language for manipulating sequences.* Arizona U.
Comp.Sci.Dept.*TR 83-20.*1983.
019336 Janssens, D. Rozenberg, G.* Graph grammars with node label
controlled rewriting and embedding.* Colorado U.
Comp.Sci.Dept.*CU-CS-251-83.*1983.
019368 Koskimies, K.*Extensions of one-pass attribute grammars.*
Helsinki U. Comp.Sci.Dept.*Rpt. A-1983-04.*1983.
019373 Shilcrat, E. Panangaden, P. Henderson, T.*Implementing
multi sensor systems in a functional language.* Utah U.
Comp.Sci.Dept.*UUCS-84-001.*1984.
------------------------------
Date: 13-Jun-84 02:36 PDT
From: William Daul Augmentation Systems Division / MDC <WBD.TYM@OFFICE-2.ARPA>
Subject: AI Forum Set For Aug. 4-8
RENSSELAERVILLE, N.Y. -- Marvin Minsky, a co-founder and member of the MIT
Artificial Intelligence Laboratory, and science fiction writer/scientist Isaac
Asimov will address "Artificial Intelligence: Are We Being Outsmarted?" in an
Aug. 4-8 program at the Rensselaerville Institute located here.
The program will be conducted in the manner of a hearing, and Asimov and Minsky
will be questioned by participants in the AI program.
The cost for the program is $250. More information can be obtained from
Mary-Ann Ronconi, Public Programs Coordinator, The Rensselaerville Institute,
Rensselartville, N.Y. 12147.
------------------------------
Date: 06/11/84 12:23:47
From: AH
Subject: Seminar - Motion of Objects in Contact
[Forwarded from the MIT bboard by SASW@MIT-MC.]
DATE: Thursday, June 14, 1984
TIME: Refreshments 3:45PM
Lecture 4:00PM
PLACE: NE43-512A
"THE MOTION OF OBJECTS IN CONTACT"
Professor John Hopcroft
Cornell University
There is an increasing use of computers in the design, manufacture and
manipulation of physical objects. An important aspect of reasoning about such
actions concerns the motion of objects in contact. The study of problems of
this nature requires not only the ability to represent physical objects but the
development of a framework or theory in which to reason about them. In this
talk such a development is investigated and a fundamental theorem concerning
the motion of objects in contact is proved. The simplest form of this theorem
states that if two objects in contact can be moved to another configuration in
which they are in contact, then there is a way to move them from the first
configuration to the second configuration such that the objects remain in
contact throughout the motion. The obvious applications of this result in
compliant motion and also applications in motion planning are discussed.
HOST: Professor Silvio Micali
------------------------------
Date: Mon, 11 Jun 84 14:08:17 PDT
From: Philip Westlake <westlake@AEROSPACE>
Subject: Seminar - AI and APL
APL Users Group Meeting
The Aerospace Corporation APL Users Group is honored to present:
Dr. Zdenek V. Jizbz and Ms. Phuong T. Nguyen
of Chevron Oil Field Research Co., La Habra, California
Speaking on: "Artificial Intelligence and APL with Nested Arrays"
Wednesday, June 13, 1984
1:00 pm
A1/1062
The Aerospace Corporation
The Chevron Oil Field The Chevron Oil Field Research Company of La Habra,
California has been doing some research on Expert Systems implemented in
nested array APL and they are pleased with the rapid progress that they have
achieved in a relatively short time due to the power of nested array APL.
A vector of nested vectors can be matched to a tree structure. The utility
of this relationship, however, is relatively limited because nodes and
branches are implicit (not explicit). By adding a convention similar to that
of polish notation, modes can be made explicit. A special type of nested
vector called a scalar tree will be defined. The following powerful
properties of scalar trees will be illustrated:
1. The possibility to separate syntactic constructs from semantics
2. The ability to form AND/OR trees of arbitrary complexity, and
application of DeMorgan's law to such trees with a single
one-character APL primitive function.
3. The simplicity of building (primitive) inference engines in
just a few lines of APL code.
There will be three lectures lasting about 50 minutes each. Dr. Jizba will
be giving the first two lectures and Ms. Nguyen will be giving the third
lecture.
Lecture 1 Define Artificial Intelligence. Describe basic idea of
Expert Systems. Compare LISP to APL with nested arrays.
Define tree structures, and describe the specific concept
of an APL scalar tree. Show how recursuve functions are
used to operate on nested arrays.
Lecture 2 Introduce Predicate Calculus, and illustrate how it can be
implemented using APL nested structures. Describe
Production rules, and Inference Engine in APL implementation.
Describe DRIVER function that allows English-like
communication with user.
Lecture 3 (PTN) Understanding a sentence. Kinds of sentences. Global
and local dictionaries. Meaning. Syntactic sentences.
History trace. Handling of misspelled words and phrases.
U.S. Citizenship required in order to attend the presentation.
------------------------------
Date: 12 Jun 84 17:04:39 EDT
From: Michael Sims <MSIMS@RUTGERS.ARPA>
Subject: Seminar - Learning Equation Solving Methods
[Forwarded from the Rutgers bboard by Laws@SRI-AI.]
machine learning brown bag seminar
Title: Learning Equations Solving Methods from Worked Examples
Speaker: Bernard Silver
Dept. of Artificial Intelligence
University of Edinburgh
Date: Wednesday, June 27, 1984, 12:00-1:30
Location: Hill Center, 7th floor lounge
This talk will describe LP, a program that learns new techniques for
solving equations by examining worked examples. Unlike most of the
work in this field, where the equations have been very simple, LP uses
equations of A level standard (A levels are exams taken at 18, and are
used for university selection.)
In order to be able to successfully use a new technique, LP learns
many different types of information. At the lowest level, LP compares
consecutive lines in the worked example, finding differences between
them. This allows the program to learn new rewrite rules.
LP also tries to discover the strategic purpose of each step,
expressed in terms of satisfying preconditions of following steps.
From this viewpoint, the worked example can also be considered as a
type of plan for solving the equation. LP extracts the necessary
information, and builds a plan which is stored for future use. LP
executes the plan in a flexible way to solve new equations.
------------------------------
Date: Mon 11 Jun 84 00:17:24-PDT
From: Mabry Tyson <Tyson@SRI-AI.ARPA>
Subject: Workshop on Expert Systems
This is a repeat of an earlier announcement that went out on AILIST but
not that the date of acceptance for submissions has been moved back to
July 1.
[The original announcement appeared in AIList Vol. 2 #58, May 15, 1984.
I will send a full copy of this second announcement to anyone who requests
it. -- KIL]
---------------
Date: Sun, 10 Jun 84 15:39 EST
From: John Roach <roach%vpi.csnet@csnet-relay.arpa>
Subject: workshop on expert systems
CALL FOR PAPERS
IEEE Workshop on Principles of Knowledge-Based Systems
Sheraton Denver Tex, Denver, Colorado, 3, 4 December 1984
Please send eight copies of a 1000-2000 word double-space, typed, summary of
the proposed paper to:
Mark S. Fox
Robotics Institute
Carnegie-Mellon University
Pittsburgh, Pennsylvania 15213
July 1, 1984 is the deadline for the submission of summaries.
Authors will be notifed of acceptance or rejection by July 23, 1984.
The accepted papers must be typed on special forms and received by the program
chairman at the above address by September 3, 1984.
General Chairman
John Roach
Dept. of Computer Science
Virginia Polytechnic Institute
Blacksburg, VA 24061 (703)-961-5368
[...]
------------------------------
Date: Thu 14 Jun 84 18:11:15-PDT
From: Dikran Karagueuzian <DIKRAN@SU-CSLI.ARPA>
Subject: Workshop on Reasoning
[Forwarded from the Stanford bboard by Laws@SRI-AI.]
Stanford Workshop On
PRACTICAL REASONONING AND PLANNING
Sponsored by CSLI and the Philosophy Department
June 19-21
The workshop will involve researchers in philosophy and artificial
intelligence. Workshop organizers anticipate a productive interaction
centering on issues of belief, desire, intention, and action in humans and
machines.
All sessions will be held in Building 380 (Mathematics), Room 380Y,
unless otherwise specified.
SCHEDULE: Tuesday, June 19
10:00 to 11:45 John Searle
1:30 to 3:15 Drew McDermott
3:30 to 5:30 Allan Gibbard
Wednesday, June 20
10:00 to 11:45 Gilbert Harman
1:30 to 3:15 Thomas Hill
3:30 to 5:30 Patrick Hayes, David Israel
8:30 to 10:30 Richard Jeffery
Thursday, June 21
9:00 to 10:30 Jon Doyle
10:30 to 12:15 Hector-Neri Castaneda
2:00 to 3:45 James Allen
------------------------------
End of AIList Digest
********************
