LAWS@SRI-AI.ARPA (02/03/85)
From: AIList Moderator Kenneth Laws <AIList-REQUEST@SRI-AI.ARPA>
AIList Digest Sunday, 3 Feb 1985 Volume 3 : Issue 12
Today's Topics:
Administrivia - Sublists,
Seminars - Berkeley Prolog Machine (SU) &
Typography (CSLI) &
Conceptual Competence for Solving Problems (UCB) &
Belief Revision (CSLI) &
Nonlinear Planning (MIT) &
Syllable Recognition (CMU),
Conferences - Cognitive Science Society &
Automated Reasoning and Expert Systems &
Systems Sciences Software &
Automath and Automated Reasoning Week
----------------------------------------------------------------------
Date: Wed 30 Jan 85 09:00:34-PST
From: Ken Laws <Laws@SRI-AI.ARPA>
Subject: Sublists
Readers occasionally ask me whether there is an AIList version
that omits seminar notices, conferences, flames, or some other
subset of the usual material. Usenet readers used to ask
whether messages could be split into two or more bboard streams.
(Incidentally, our full Usenet gateway may be working again in two
or three weeks.)
At present there is no such sublist mechanism. I haven't the time
and energy to maintain multiple subscription lists; even if I did,
there is no concensus on which messages are the "good stuff".
If someone else wants to create such a "cream" distribution,
I will help any way I can. I skim material from other bboards and
lists, and I see no reason why someone shouldn't excerpt AIList and
pass his selections along. We could even have multiple splits, with
one sublist taking, say, philosophy and psychology and another carrying
psychology and linguistics. (This would cause difficulty, however, in
the eventual establishment of the sublists as independent lists.)
Another possible solution is for mailers or redistribution systems to
include message parsing code that can delete any text starting with
"Subject: Seminar -", etc. (Even the ability to skip to the next message
would be welcome. I currently read mostly "undigested" or "exploded" digests
and bboards, which is one way of getting this convenience.) If someone
wants to develop such a mail system, I am willing to cooperate in
standardizing the header keyword format.
-- Ken Laws
------------------------------
Date: Wed 30 Jan 85 09:17:43-PST
From: Ariadne Johnson <ARIADNE@SU-SCORE.ARPA>
Subject: Seminar - Berkeley Prolog Machine (SU)
[Forwarded from the Stanford bboard by Laws@SRI-AI.]
CS 300 -- Computer Science Department Colloquium -- Winter 1984-1985.
Our fifth meeting will be
Tuesday, February 5, 1985
at 4:15 in Terman Auditorium
THE BERKELEY PROLOG MACHINE
Alvin M. DESPAIN
Computer Science, Univ. of Calif.,Berkeley
The Berkeley Prolog Machine (PLM) is an experiment in high performance
architecture for executing logic programs. It is part of a longer term
effort, the Berkeley Aquarius project. The Aquarius project at Berkeley is
an on-going investigation whose ultimate research goal is to determine how
enormous improvements in performance can be achieved in a machine specialized
to calculate some very difficult "real" problems in design automation,
discrete simulation, systems, and signal processing. Our approach can be
characterized by three important points:
(1) Aquarius is to be a MIMD machine made of heterogeneous processing
elements, each of which is tailored to accommodate its own
individual processing requirements
(2) it is to exploit parallelism at all levels of execution, and
(3) it is to support logic-programming at the ISP level.
The presentation will include a discussion of the systems architecture of
Aquarius. The main discussion will focus on the Prolog Machine(PLM)
and will describe its key innova- tive features and development status.
Some performance estimates of the PLM as derived from simulation studies will
be presented.
------------------------------
Date: Wed 30 Jan 85 17:26:40-PST
From: Emma Pease <Emma@SU-CSLI.ARPA>
Subject: Seminar - Typography (CSLI)
[Excerpted from the CSLI Newsletter by Laws@SRI-AI.]
12 noon, 2/7 TINLunch
Ventura Hall Excerpts from Charles Bigelow's ``Principles of
Conference Room Structured Font Design for the Personal Workstation''
and Fernand Baudin's
``Typography: Evolution + Revolution''
Discussion led by David Levy
The TINlunch of February 7 will focus on some of the issues surrounding the
new computer technology exemplified by TEDIT, TEX, and EMACS. These ``word
processing'' and ``document preparation'' systems are, of course, nothing
other than ``writing'' tools -- intended for writing with the aid of the
computer. The first reading, an excerpt from an article by Charles
Bigelow, discusses the design of typefaces in the new digital medium as a
problem of balancing conservation and innovation: conserving the legibility
and elegance of our inherited letter forms while meeting the demands of the
new medium. In the second reading, Fernand Baudin suggests that the new
writing technology will require of us a new literacy: not just the ability
to read and write, but the ability to organize our writing visually -- that
is, typographically. He calls for ``the close cooperation of specialists
in many branches: linguist[ic]s, communication, psychology, history,
technology.'' --David Levy
------------------------------
Date: Thu, 31 Jan 85 11:56:01 pst
From: chertok%ucbcogsci@Berkeley (Paula Chertok)
Subject: Seminar - Conceptual Competence for Solving Problems (UCB)
BERKELEY COGNITIVE SCIENCE PROGRAM
Spring 1985
Cognitive Science Seminar -- IDS 237B
``Conceptual Competence for Understanding and Solving Problems''
James G. Greeno, School of Education, UC Berkeley
TIME: Tuesday, February 5, 11 - 12:30
PLACE: 240 Bechtel Engineering Center
DISCUSSION: 12:30 - 2 in 200 Building T-4
Behavior of people, including children, can include generative
conformity to principles in a way that supports conclusions
that they understand the principles. This understanding may be
implicit, involving a kind of competence. Examples involving
principles of number, analyzed using planning nets, and princi-
ples of set theory, analyzed using Montague grammar, will be
discussed.
------------------------------
Date: Wed 30 Jan 85 17:26:40-PST
From: Emma Pease <Emma@SU-CSLI.ARPA>
Subject: Seminar - Belief Revision (CSLI)
[Excerpted from the CSLI Newsletter by Laws@SRI-AI.]
SUMMARY OF THE F4 MEETING ON JANUARY 7
The topic was an overview belief revision as a research area in AI.
``Belief revision'' is a broad enough term to cover many different types of
inferential activity in AI. We discussed four types: (1) Search theory, in
which assumptions are made and retracted in an effort to find a problem
solution; (2) ``Truth'' maintenance systems a la Doyle. There are
foundational theories of belief in the sense of Harmon, with a set of
unsupported premises underlying all beliefs. The key feature of these
systems is their attempt to keep track of all justifications for belief,
and to revise these justifications in the face of contradictory belief.
(3) Database updates in the presence of integrity constraints or
user-defined views, in which case the update can become ambiguous. The
syntactic approach of Vardi et. al. was reviewed. (4) Ad-hoc approaches
designed for particular domains, for example the simple ``believe what you
see'' principle embedded in Shakey the robot.
Ned Block made the interesting observation that belief revision in the
AI context did not correspond to scientific theory revision as discussed in
the philosophical literature; for example, the principle of simplicity did
not seem to be a criterion for revision. This provoked a large amount of
discussion. --Kurt Konolige
------------------------------
Date: 31 Jan 1985 14:20 EST (Thu)
From: "Daniel S. Weld" <WELD%MIT-OZ@MIT-MC.ARPA>
Subject: Seminar - Nonlinear Planning (MIT)
[Forwarded from the MIT bboard by SASW@MIT-MC.]
Nonlinear Planning: A Rigorous Reconstruction
Dave Chapman - AI Revolving Seminar
The problem of achieving conjunctive goals has been central
to domain-independent planning research; the nonlinear
constraint-posting approach has been most successful. Previous
planners of this type have been complicated, heuristic, and
ill-defined. I will present a simple, precise algorithm and prove it
correct and complete. The analytic tools I have developed in
constructing this algorithm clarify previous planning research. The
frame problem is revealed as the limiting factor in the range of
applicability of state-of-the-art planners. I will suggest a new
approach for future research.
TUESDAY 2/5/85 4:00pm 8th floor playroom
*** NOTE PERMANENT CHANGE OF DAY ***
------------------------------
Date: 31 Jan 85 11:47:59 EST
From: Steven.Shafer@CMU-CS-IUS
Subject: Seminar - Syllable Recognition (CMU)
[Forwarded from the CMU-AI bboard by Laws@SRI-AI.]
Speaker: Renato DeMori, Concordia University, Montreal
Topic: Parallel Algorithms for Syllable Recognition in Continuous Speech
Dates: 5-Feb-85
Time: 3:30 pm
Place: WeH 5409
The talk describes a distributed rule-based system for automatic
speech recognition. Acoustic property extraction and feature
hypothesization are performed by the application of sequences of
operators. The sequences, called plans, are executed by cooperative
expert programs. Experimental results on the automatic segmentation
and recognition of phrases, made of connected letters and digits are
described and discussed.
------------------------------
Date: Mon, 28 Jan 85 09:15:56 pst
From: gluck@SU-PSYCH (Mark Gluck)
Subject: Conference - Cognitive Science Society
[Forwarded from the Stanford bboard by Laws@SRI-AI.]
7th Annual Conference of the COGNITIVE SCIENCE SOCIETY
August 15-17, 1985
U.C. Irvine
Call for Papers
Submission Deadline: 11 MARCH 1985
Topics: Language Processing, Memory Models, Vision Processing, Belief
Systems, Learning and Memory, Perception, Knowledge Representation,
Inference Mechanisms
Submission:
Four copies,
Papers: 5000 word maximum
Posters: 2000 word maximum
Include: named, address, phone number
four key words
abstract (100-250 words)
total word length
Send to: Richard Granger
Computer Science Dept.
University of California
Irvine, CA 92717
------------------------------
Date: Wed 30 Jan 85 09:46:10-PST
From: C.S./Math Library <LIBRARY@SU-SCORE.ARPA>
Subject: Idaho State University Conference on Automated Reasoning and
Expert Systems
[Forwarded from the Stanford bboard by Laws@SRI-AI.]
Idaho State University, Pocatello, Idaho, Dept. of Mathematics is sponsoring
their 8th miniconference in the area of Automated Reasoning and Expert
Systems. (Does anyone know if this means they have had 8 conferences on
automated reasoning or that only the 8th conference is devoted to automated
reasoning?) They have sent out a call for papers for the conference to
be held in Pocatello on April 26-27, 1984. The people to contact are
Larry Winter 208-236-2501 or Bob Girse 208-236-3819 Department of Math.
Idaho State University, Pocatello Idaho 83209. Dr. Ewing Lusk of the
Automated Reasoning Group at Argonne National Lab. will be the principal
speaker. Is anyone familiar with any of the research in this area
going on at Idaho State Univ.?
Harry Llull
------------------------------
Date: Sat, 26 Jan 85 16:36:00 EST
From: "Bruce D. Shriver"
<shriver.yktvmv%ibm-sj.csnet@csnet-relay.arpa>
Subject: Conference - Systems Sciences Software
CALL FOR: Papers, Referees, Session Coordinators, Task Forces
=============================================================
SOFTWARE TRACK of the Hawaii International Conference on System Sciences
========================================================================
HICSS-19 is the ninteenth in a series of conferences devoted to advances
in information and system sciences. The conference will encompass develop-
ments theory and practice in the areas of systems architecture, software,
decision support systems, and knowledge-based systems. The conference is
sponsored by the University of Hawaii and the University of Southwestern
Louisiana in cooperation with the ACM and the IEEE Computer Society. It
will be held on Jan. 8-10, 1986 in Honolulu, Hawaii. Papers, referees,
and session coordinators are solicited in the following areas:
Software Design Tools, Techniques, and Environments
Models of System and Program Behavior
Testing, Verification, and Validation
Professional Workstation Environments
Alternative Language Paradigms
Reuseability in Design and Implementation
Knowledge-Based Systems Software
Algorithm Analysis and Animation
Visual Languages
Please submit six (6) copies of the full paper (not to exceed 26 double-
spaced pages including diagrams) by July 5, 1985 directly to:
Bruce D. Shriver
HICSS-19 Software Track Coordinator
IBM T. J. Watson Research Center
PO Box 218, Route 134
Yorktown Heights, NY 10598
(914) 945-1664
csnet: shriver.yktvmv@ibm-sj
------------------------------
Date: Fri, 1 Feb 85 12:28:11 est
From: minker@maryland (Jack Minker)
Subject: AUTOMATH AND AUTOMATED REASONING WEEK AT MARYLAND MARCH 4-8, 1985
WEEK
of
AUTOMATH AND AUTOMATED REASONING
at
THE UNIVERSITY OF MARYLAND
MARCH 4 - MARCH 8, 1985
The Mathematics and Computer Science Departments at the
University of Maryland at College Park and the National Sci-
ence Foundation are jointly sponsoring a Special Year in
Mathematical Logic and Theoretical Computer Science. The
week of March 4-8, 1985 will be devoted to Automath and
Automated Reasoning. There will be ten distinguished lec-
tures as follows:
Monday, March 4 1100-1230 Nicolas deBruin
"THE AUTOMATH PROJECT"
Monday, March 4 1500-1630 Jeffrey Zucker
"FORMALIZATION OF CLASSICAL MATHEMATICS IN
AUTOMATH"
Tuesday, March 5 1000-1130 Woody Bledsoe
"HIGH LEVEL PLANS FOR AN INEQUALITY PROVER"
Tuesday, March 5 1400-1530 Larry Wos
"AUTOMATED REASONING: INTRODUCTION AND APPLICA-
TION"
Wednesday, March 6 1100-1230 Larry Wos
"AUTOMATED REASONING: OPEN QUESTIONS FROM ALGE-
BRA AND FORMAL LOGIC"
Wednesday, March 6 1430-1600 Woody Bledsoe
"USING ANALOGY IN AUTOMATIC THEOREM PROVING"
Thursday, March 7 1030-1200 Robert Constable
"PROGRAMMING AS FORMAL MATHEMATICS"
Thursday, March 7 1330-1500 Peter Andrews
"TYPED LAMBDA CALCULUS AND AUTOMATIC THEOREM
PROVING"
Friday, March 8 1100-1230 Robert Constable
"CONSTRUCTIVE MATHEMATICS AS PROGRAMMING"
Friday, March 8 1330-1500 Peter Andrews
"TOWARDS AUTOMATING HIGHER ORDER LOGIC"
All lectures will be given at:
Mathematics Building, Room Y3206
The lectures are open to the public. If you plan to
attend kindly notify us so that we can make appropriate
plans for space. Limited funds are available to support
junior faculty and graduate students for the entire week or
part of the week. To obtain funds, please submit an appli-
cation listing your affiliation and send either a net mes-
sage or a letter to:
Jack Minker
Department of Computer Science
University of Maryland
College Park, MD 20742
(301) 454-6119
minker@maryland
------------------------------
End of AIList Digest
********************