Copy Link
Add to Bookmark
Report
AIList Digest Volume 2 Issue 071
AIList Digest Thursday, 7 Jun 1984 Volume 2 : Issue 71
Today's Topics:
Games & Expert Systems - Source Information,
AI Programming - Definitions,
Expert Systems - MYCIN Demo,
Humor - Turing Machine,
AI Contracts - Automated Classification and Retrieval,
Seminar - Programming by Example,
Conferences - Approximately Solved Problems
----------------------------------------------------------------------
Date: 6 Jun 1984 13:12:28 EDT
From: Perry W. Thorndyke <THORNDYKE@USC-ISI>
Subject: computer war games
Reply to Chuck McManis's request for information on war games:
There are literally hundreds of programs, written in a variety of languagues
for a variety of machines, that support battle simulation or war gaming.
A catalog of these is published annually and is available under the title
"Catalog of Wargaming and Military Simulation Models" from Studies,
Analysis, and Gaming Agency; Organization of the Joint Chiefs of Staff;
The Pentagon; Washington, D.C.
Few, if any, of the systems described in the catalog provide "intelligent"
simulation of opponent behavior. One reason for this is that there exists
no articulated model for expertise in tactical planning and decision making.
We at Perceptronics are developing a Navy tactical battle game with an
automated opponent based on a cognitive model of tactics. The project is a
vehicle to explore (1) development of an expert model of time-stressed
tactical decision making, (2) development of an instructional system to
teach these skills to a novice, (3) automating an adaptive, intelligent
opponent using the expert model, and (4) making the opponent behavior
modifiable under program control of the instructional system to achieve
pedagogical objectives. A technical report is due out soon; if you are
interested, send your address and I'll add you to the mailing list.
Perry Thorndyke
Perceptronics, Inc.
545 Middlefield Road
Menlo Park, CA 94025
(415) 321-4901
thorndyke@usc-isi
------------------------------
Date: 6 Jun 84 16:34:24 EDT (Wednesday)
From: Chris Heiny <Heiny.henr@XEROX.ARPA>
Subject: Re: Computer Wargames
Sounds like you've got your work cut out. It'll probably be
considerably more complex than a chess player, because chess is the
simplest of wargames (I choose to ignore checkers): 2 players with 32
counters (of 6 types) on a 64 space board, with relatively limited
connections (4) per space. More complex wargames have more players,
with hundreds of counters (of many more than 6 types) on a board with
thousands of spaces, each space usually connnecting to 6 others. The
rules are vastly more complex as well.
The project sounds pretty interesting though, and I'll be glad to lend
what aid I can from this distance.
Chris
------------------------------
Date: Sun, 3 Jun 84 15:07 PDT
From: Brian Reid <reid@Glacier>
Subject: AI programs: a definition
[Forwarded from the Stanford bboard by Laws@SRI-AI.]
An AI program is a program written by a person who fervently believes that
he is doing AI as he writes the program. Mere belief is not sufficient; it
must be zealous belief.
------------------------------
Date: Sun, 3 Jun 84 16:18 PDT
From: Mark Kent <kent@Navajo>
Subject: AI programs: addition to a definition
[Forwarded from the Stanford bboard by Laws@SRI-AI.]
In addition to the definition given by reid@Glacier:
An AI program is a program in which at least one of the important
subproblems that needs solving is solved by a brute force method.
------------------------------
Date: Sun 3 Jun 84 20:23:27-PDT
From: Bruce Buchanan <BUCHANAN@SUMEX-AIM.ARPA>
Subject: AI Program Demo
[Forwarded from the Stanford bboard by Laws@SRI-AI.]
[The following is part of an exchange of messages about the percentage
of graduating AI students who have been exposed to actual AI program
demos. I have edited it slightly. -- KIL]
MYCIN is available on SUMEX from the guest account -- remember that
large jobs are slow during the day. Once on Sumex, type
<MYCIN>MYCIN
to the Exec and read the help options. If you don't know much
medicine it might be a good idea to run a library case first.
You should not need someone else to demo it for you, but there
are still people around who worked on MYCIN when it was an active
project if you need help.
The password for the Sumex guest acct is available from RYALLS @ SUMEX.
A caveat: the medical knowledge base has not been updated
in the past several years to reflect knowledge of new drugs or
improved therapies.
bgb
------------------------------
Date: Mon 4 Jun 84 08:46:07-PDT
From: Bud Spurgeon <SPURGEON@SU-CSLI.ARPA>
Subject: Re: Have you seen?
[Forwarded from the Stanford bboard by Laws@SRI-AI.]
How may MTC students have seen a Turing machine?
-- Moshe Vardi
Our DEC 2060 nicknamed "TURING" is on view daily in the Pine Hall machine
room.
-Bud :-)
(P.S. We're still looking for a tape cabinet capable of storing infinitely
long tape.)
(P.P.S. Backups on this thing take FOREVER.)
------------------------------
Date: Fri, 1 Jun 84 09:26:42 edt
From: aronson@nlm-mcs (Jules P. Aronson)
Subject: Research Contract
Please distribute the following announcement to Research people in the
fields of AI and Information Science:
--------------------------------------------------------------
AUTOMATED CLASSIFICATION AND RETRIEVAL PROJECT -- The Lister Hill National
Center for Biomedical Communications, National Library of Medicine, is
developing a research project to investigate, develop, and evaluated
Information Science, Computational Linguistics and Artificial Intelligence
techniques which support the automated classification and retrieval of
biomedical literature. The project shall include investigations in natural
language understanding, knowledge representation, and information retrieval,
to explore the development of automated systems for identifying,
representing, and retrieving relevant concepts and main ideas from printed
documents.
Written requests for RFP NLM-84-115/PSP, should be addressed to the National
Library of Medicine, Office of Contracts Management, Building 38A, Room
B1N17, 8600 Rockville Pike, Bethesda, Maryland 20209, Attention: Patricia
Page. The RFP will be available in approximately 30 days and will close 30
days after it is issued.
------------------------------
Date: Tue 5 Jun 84 23:15:02-EDT
From: JMILLER%MIT-OZ@MIT-MC.ARPA
Subject: Seminar - Programming by Example
[Forwarded from the MIT bboard by SASW@MIT-MC.]
Title: Programming by Example
Speaker: Dan Halbert, University of California, Berkeley,
and Xerox Corporation, Office Systems Division
Wednesday, June 6, 2pm, AI playroom (8th floor, Tech Square)
Most computer-based applications systems cannot be programmed by their
users. We do not expect the average user of a software system to be able
to program it, because conventional programming is not an easy task.
But ordinary users can program their systems, using a technique called
"programming by example". At its simplest, programming by example is
just recording a sequence of commands to a system, so that the sequence
can be played back at a later time, to do the same or a similar task.
The sequence forms a program. The user writes the program -in the user
interface- of the system, which he already has to know in order to
operate the system. Programming by example is "Do what I did."
A simple program written by example may not be very interesting. I will
show methods for letting the user -generalize- the program so it will
operate on data other than that used in the example, and for adding
control structure to the program.
In this talk, I will describe programming by example, discuss current
and past research in this area, and also describe a particular
implementation of programming by example in a prototype of the Xerox
8010 Star office information system.
------------------------------
Date: Thu 24 May 84 16:29:48-EDT
From: Joseph Traub <TRAUB@COLUMBIA-20.ARPA>
Subject: Call for papers
CALL FOR PAPERS
Symposium on Complexity of Approximately Solved Problems
April 17-19, 1985
Computer Science Department
Columbia University
New York, NY 10027
SUPPORT: This symposium is supported by a grant from the System Development
Foundation.
SCOPE: This multidisciplinary symposium focuses on problems which are
approximately solved and for which optimal algorithms or complexity results
are available. Of particular interest are distributed systems, where
limitations on information flow can cause uncertainty in the approximate
solution of problems. The following is a partial list of topics: distributed
computation, approximate solution of hard problems, applied mathematics,
signal processing, numerical analysis, computer vision, remote sensing,
fusion of information, prediction, estimation, control, decision theory,
mathematical economics, optimal recovery, seismology, information theory,
design of experiments, stochastic scheduling.
INVITED SPEAKERS: The following is a list of invited speakers.
L. Blum, Mills College J. Halpern, IBM
L. Hurwicz, University of Minnesota D. Johnson, AT&T - Bell Laboratories
J. Kadane, Carnegie-Mellon University R. Karp, Berkeley
H.T. Kung, Carnegie-Mellon University D. Lee, Columbia University
M. Milanese, Politecnico di Torino C.H. Papadimitriou, Stanford University
J. Pearl, UCLA M. Rabin, Harvard University and
Hebrew University
S. Reiter, Northwestern University A. Schonhage, University of Tubingen
K. Sikorski, Columbia University S. Smale, Berkeley
J.F. Traub, Columbia University G. Wasilkowski, Columbia University
and University of Warsaw
A.G. Werschulz, Fordham University H. Wozniakowski, Columbia University
and University of Warsaw
CONTRIBUTED PAPERS: All appropriate papers for which abstracts are contributed
will be scheduled. To contribute a paper send title, author, affiliation, and
abstract on one side of a single 8 1/2 by 11 sheet of paper.
TITLES AND ABSTRACTS MUST BE RECEIVED BY JANUARY 15, 1985
PUBLICATION: Invited papers will be published.
REGISTRATION: The symposium will be held in the Kellogg Conference Center on
the Fifteenth Floor of the International Affairs Building, 118th Street and
Amsterdam Avenue. The conference schedule and paper abstracts will be
available at the registration desk. Registration will start at 9:00 a.m.
There is no registration charge.
FOR FURTHER INFORMATION: The program schedule for invited and contributed
papers will be mailed by about March 15 only to those responding to this
Call for Papers. If you have any questions, contact TRAUB@Columbia-20.ARPA.
To help us plan for the symposium please send the following information to
NG@Columbia-20.ARPA.
Name: ________________________ Affiliation: _______________________________
Address: __________________________________________________________________
City: ___________________ State: _____________________ Zip: _______________
( ) I will attend the Complexity Symposium.
( ) I may contribute a paper.
( ) I may not attend, but please send program.
------------------------------
End of AIList Digest
********************
