Copy Link
Add to Bookmark
Report
AIList Digest Volume 2 Issue 056
AIList Digest Monday, 7 May 1984 Volume 2 : Issue 56
Today's Topics:
AI Software - Request for AI Demos,
Seminars - Object-Oriented Programming in Prolog &
SIGNUM & Learning in Production Systems & Nonmonotonic Reasoning,
Conference - 12th POPL Call for Papers
----------------------------------------------------------------------
Date: 30 Apr 84 19:14:00-PDT (Mon)
From: ihnp4!inuxc!iuvax!wickart @ Ucb-Vax
Subject: Needed: AI demos
Article-I.D.: iuvax.3600001
I need some simplistic AI demo programs to help convert the infidels.
EMYCIN, ELIZA/DOCTOR, PARANOID, SHRDLU, and REVERSE would be greatly
appreciated. I can handle LISP, PASCAL, FORTRAN(in AI?), BAL(perish
the thought), C, or PL/I. Can anyone out there help out? USENET is the
only thing that maintains our existence in the USA.
Thanks in advance,
T.F. Prune (aka Bill Wickart, ihnp4!inuxc!iuvax!wickart)
------------------------------
Date: Fri, 4 May 84 17:32:06 edt
From: jan@harvard (Jan Komorowski)
Subject: Seminar - Object-Oriented Programming in Prolog
[Forwarded from the MIT bboard by SASW@MIT-MC.]
"Object-Oriented Programming in Prolog"
Carlo Zaniolo
Bell Laboratories
Monday, May 7, 1984
at 4 PM
Aiken Lecture Hall, Harvard University
(tea in Pierce 213 at 3:30)
Object-oriented programming has proved very useful in a number of
important applications, because of its ability to unify and simplify the
description of entities and their protocols. Here, we propose a similar
approach for providing this programming paradigm in Prolog. We introduce
primitives to support the notions of (1) an object with its associated set of
methods, (2) an inheritance network whereby an object inherits the methods of
its ancestors, and (3) message passing between objects.
Objects and methods are specified by a declaration object with
method_list, where object is a Prolog predicate and each method is an arbitrary
Prolog clause. Then, a message O:M can be specified as a goal, to request the
application of method M to object O. The inheritance network, specified by the
isa operator as follows sub_object isa object, is most useful in handling
default information. Thus it is possible to specify a method that holds by
default for a general class, and then specify special subcases for which the
general rule is overridden.
This new functionality is added on top of existing Prolog systems, with no
modification to its interpreter or compiler.
Host: H.J. Komorowski
------------------------------
Date: 28 Apr 84 5:13:41-PST (Sat)
From: decvax!genrad!mit-eddie!whuxle!floyd!cmcl2!lanl-a!unm-cvax!unmva
x!stanly @ Ucb-Vax
Subject: Seminar - SIGNUM meeting and introduction
Article-I.D.: unmvax.312
SIGNUM is the Special Interest Group in Numerical Mathematics of the
ACM ( American Computing Machinery). The group meets monthly for
the academic year. At each meeting there is a talk on some subject
related to computing or applied mathematics. The talks are not
restricted to numerical stuff. If you would like to be on the mailing
list please send a note to John. A correct address from unmvax is:
WISNIEWSKI@SANDIA.ARPA@lanl-a.UUCP
Stan Steinberg
stanly@unmvax
*******************************************************************
Rio Grande Chapter SIGNUM Meeting
Year end meeting and election of officers
Date: Tuesday, May 8, 1984
Speakers: Kathie Hiebert Dodd and Barry Marder - Sandia
Applied AI - "Brave New World" or "Catastrophe Theory Revisited"?
Barry Marder
Last year an effort was initiated at Sandia to develop a core of
expertise in the field of artificial intelligence. One area of
investigation has been expert system technology, which has been
largely responsible for the present explosive growth of interest in
AI. An expert system is a program that catalogs and makes readily
available expert knowledge in a field. Such a system has been built
and implemented at Sandia to aid in the design of electrical cables
and connectors. The speaker will describe this system and offer some
observations on artificial intelligence in general.
VEHICLE IDENTIFICATION -- A FRAME BASED SYSTEM
Kathie Hiebert Dodd
Software has been developed that, when given certain characteristics
from a scene such as the location of wheels, can identify vehicles.
The image processing, ie extracting the characteristics from the
scene is still done primarily on a VAX. Given the features a frame
based code using "flavors" in the Zetalisp language on a Symbolics
3600 does the vehicle identification. The main emphasis of the talk
will be on the aspects of a frame based expert system, in particular
the use of "flavors" and "deamons".
Location: The Establishment - Albuquerque Dukes Sports Stadium
Price: 10.50 per person - serving Prime Rib (I think)
Social Hour : 5:30 P.M., Dinner: 6:00 P.M., Talks: 7:00 P.M.
PLEASE LET JOHN WISNIEWSKI KNOW BY NOON MONDAY THE 7TH IF YOU ARE
COMING TO DINNER. If no answer leave a message with EVA 844-7747.
------------------------------
Date: 4 May 1984 1316-EDT
From: Geoff Hinton <HINTON@CMU-CS-C.ARPA>
Subject: Seminar - Learning in Production Systems
[Forwarded from the CMU-AI bboard by Laws@SRI-AI.]
The AI seminar on May 8 will be given by John Holland of the University
of Michigan.
Title: Learning Algorithms for Production Systems
Learning, broadly interpreted to include processes such as induction, offers
attractive possibilities for increasing the flexibility of rule-based
systems. However, this potential is likely to be realized only when the
rule-based systems are designed ab initio with learning in mind.
In particular, there are substantial advantages to be gained when
the rules are organized in terms of building blocks suitable for
manipulation by the learning algorithms (taking advantage of the
principles expounded by Newell & Simon). This seminar will concentrate on:
1. Ways of inducing useful building blocks and rules from experience,
and
2. Learning algorithms that can exploit these possibilities through
"apportionment of credit" and "recombination" of building blocks.
------------------------------
Date: Sat 5 May 84 18:45:28-PDT
From: Benjamin Grosof <GROSOF@SUMEX-AIM.ARPA>
Subject: Seminars - Nonmonotonic Reasoning
[Forwarded from the CSLI bboard by Laws@SRI-AI.]
Our regular meeting time and place is Wednesdays 1-2pm (with some
runover to be expected), in Redwood Hall Room G-19. [...]
Wednesday, May 16:
Drawing A Line Around Circumscription
David Etherington
University of British Columbia, Vancouver
The Artificial Intelligence community has been very interested in
the study of reasoning in situations where only incomplete information
is available. Predicate Circumscription and Domain Circumscription
provide tools for nonmonotonic reasoning in such situations.
However, not all of the problems which might be expected to yield to
circumscriptive inference are actually addressed by the techniques
which have been developed thus far.
We outline some unexpected areas where existing techniques are
insufficient.
Wednesday, May 23
DEFAULT REASONING AS CIRCUMSCRIPTION
A Translation of Default Logic into Circumscription
OR Maximizing Defaults Is Minimizing Predicates
Benjamin Grosof of Stanford
Much default reasoning can be formulated as circumscriptive. Using a revised
version [McCarthy 84] of circumscription [McCarthy 80], we propose a
translation scheme from default logic [Reiter 80] into circumscription. An
arbitrary "normal" default theory is translated into a corresponding
circumscription of a first-order theory. The method is extended to translating
"seminormal" default theories effectively, but is less satisfactorily concise
and elegant.
Providing a translation of seminormal default logic into circumscription
unifies two of the leading formal approaches to nonmonotonic reasoning, and
enables an integration of their demonstrated applications. The naturalness
of default logic provides a specification tool for representing default
reasoning within the framework of circumscription.
------------------------------
Date: Fri, 4 May 84 15:52 PDT
From: Brian Reid <reid@Glacier>
Subject: 12th POPL Call for Papers
Call for Papers: 12th POPL
The twelfth annual ACM SIGACT-SIGPLAN symposium on
PRINCIPLES OF PROGRAMMING LANGUAGES
New Orleans, Louisiana, January 13-16, 1985
The POPL symposium is devoted to the principles of programming
languages. In recent years there have been many papers on
specific principles and specific programming languages embodying
those principles, which might lead one to believe that the symposium is
limited to papers on those topics.
We are eager for papers on important new topics, and therefore this
year we shall not attempt to prescribe particular topics. We
solicit papers that describe important new research results having
to do with the principles of programming languages. We not only
solicit, but seek and encourage, papers describing work in which an
implemented system embodies an important principle in such a way that
the usefulness of that principle can be better understood. All
submitted papers will be read by the program committee.
Brian Reid, Stanford University (Program Chairman)
Douglas Comer, Purdue University
Stuart Feldman, Bell Communications Research
Joseph Halpern, IBM Research
David MacQueen, AT&T Bell Laboratories
Michael O'Donnell, Johns Hopkins University
Vaughan Pratt, Sun Microsystems and Stanford Univ.
Guy Steele, Tartan Laboratories
David Wall, DEC Western Research Laboratory
Please submit nine copies of a 6- to 10-page summary of your paper to
the program chairman. Summaries must be typed double spaced, or typeset
10 on 16. It is important to include specific results, and specific
comparisons with other work. The committee will consider the relevance,
clarity, originality, significance, and overall quality of each
summary. Mail to:
Brian K. Reid
Computer Systems Laboratory, ERL 444
Department of Electrical Engineering
Stanford University
Stanford, California, 94305 U.S.A.
(Persons submitting papers from countries in which access to copying
machines is difficult or impossible are welcome to submit a single copy.)
Summaries must be received by the program chairman by August 3, 1984.
Authors will be notified of acceptance or rejection by September 25,
1984. The accepted papers must be received in camera-ready form by the
program chairman at the above address by November 9, 1984. Authors of
accepted papers will be expected to sign a copyright release form.
Proceedings will be distributed at the symposium and will be
subsequently available for purchase from ACM. The local arrangements
chairman is Bill Greene, University of New Orleans, Computer Science
Department, New Orleans, Louisiana 70148
------------------------------
End of AIList Digest
********************
