Copy Link
Add to Bookmark
Report
AIList Digest Volume 5 Issue 241
AIList Digest Thursday, 22 Oct 1987 Volume 5 : Issue 241
Today's Topics:
Seminars - Crystallizing Theories out of Knowledge Soup (SU) &
Event-Based Reasoning for Multiagent Domains (Bendix & BBN) &
Computing in the Year 2001 (Aston) &
Restricted And-Parallelism for Logic Programs (SMU),
Course - Information Processing
----------------------------------------------------------------------
Date: Tue 20 Oct 87 17:47:25-PDT
From: Marcelo Hoffmann <HOFFMANN@KL.SRI.Com>
Subject: Seminar - Crystallizing Theories out of Knowledge Soup (SU)
John Sowa, a member of the IBM Systems Research Institute will be
giving a talk titled "Crystallizing Theories out of Knowledge Soup
(knowledge base)", on Thursday, October 22, at 7:00 PM in Room 380C
Mathematics Department, Stanford University (while facing the Quad
from Palm Drive, in the nearest, right hand corner of the Quad). The
talks is sponsored by the IEEE Computer Society.
Abstract:
"The most challenging problems for AI arise from the difficulty of
characterizing the knowledge soup, analyzing it, and codifying it in
formal symbolic terms. These problems appear in many different guises
in knowledge acquisition, machine learning, metaphor analysis,
nonmonotonic reasoning, and reasoning with uncertainty. No complete,
formal solutions are possible, but methods of conceptual analysis,
belief revision, and dynamic type hierarchies permit special-case
subtheories to be crystallized out of the knowledge soup as needed.
This talk will use conceptual graphs as the formalism for representing
the crystallized theories and show how they can be used with belief
revision systems and dynamically changing type hierarchies".
Attendance is free.
------------------------------
Date: Thu, 15 Oct 87 08:49 EDT
From: DON%atc.bendix.com@RELAY.CS.NET
Subject: Seminar - Event-Based Reasoning for Multiagent Domains
(Bendix & BBN)
Where: Allied-Bendix Aerospace Technology Center
9140 Old Annapolis Rd (MD 108)
Columbia, MD 21045
When: 28 October 1987, 1:30pm
Who: Amy L. Lansky
SRI International, Artificial Intelligence Center
What: Localized Event-Based Reasoning for Multiagent Domains
This talk will present GEM, a structured, event-based concurrency model,
and GEMPLAN, a multiagent planner based on this model. A key focus of
this work has been the development of localized techniques for domain
representation and reasoning. Such techniques partition domain
descriptions and reasoning tasks according to the regions of activity
within a domain. GEM's use of locality is beneficial for alleviating
the frame problem in multiagent domains. GEMPLAN is a planning
architecture based on localized planning search spaces. By explicitly
utilizing constraint and property localization, GEMPLAN can pinpoint and
rectify interactions among regional search spaces, thereby reducing the
burden of ``interaction analysis'' ubiquitous to most planning systems.
Directions and RSVP (optional but helpful for planning):
Roz Alme (301) 964-4106 or ROZ@ATC.BENDIX.COM.
Marc Vilain <MVILAIN@G.BBN.COM> reports that the same seminar will be
given at BBN:
10 Moulton Street
2nd floor large conference room
10:30 am, Monday October 26
------------------------------
Date: 16-OCT-1987 16:55:10
From: HANCOXPJ@MAIL.ASTON.AC.UK
Subject: Seminar - Computing in the Year 2001 (Aston)
From: Dr P J Hancox <HANCOXPJ@uk.ac.aston>
Dept: Computer Science
Tel No: 021 359 3611 X4652
Aston University
Department of Computer Science and Applied Mathematics
Seminar
Wednesday 28 October 1987 at 3.00 pm in Room 550, Main Building
Computing in the year 2001
Brian Oakley
Director, The Alvey Directorate, London
The key to the advance in computing over the last 20 years has been the
inexorable increase in the speed, power and memory capacity of the silicon
chip. Will this continue and, if so, for how long? The talk will consider
the performance of the integrated circuit in the year 2001, and the
resulting power of the processor on a chip. Well before the turn of the
century multi-processors will have become common place, so that system
power will far exceed the individual processor power. And what will this
power be used to do? The talk will end by considering the new applications,
particularly the spread of so-called AI applications such as Expert
Systems, Natural Language, Voice and Image Processing.
Chairman: Dr B Gay.
Enquiries:
JANET: compsci@uk.ac.aston.mail
uucp: seismo!mcvax!ukc!aston!compsci
Computer Science, Aston University, Birmingham, B4 7ET, United Kingdom
+ 44 21 359 3611 extn 5313
------------------------------
Date: Mon, 19 Oct 1987 00:32 CST
From: Leff (Southern Methodist University)
<E1AR0002%SMUVM1.BITNET@wiscvm.wisc.edu>
Subject: Seminar - Restricted And-Parallelism for Logic Programs (SMU)
Restricted And-Parallelism for Logic Programs
SPEAKER: Doug DeGroot LOCATION: 315 SIC Southern Methodist University
Texas Instruments Inc. TIME: 1:30 pm
ABSTRACT
A number of parallel execution models have been proposed for the
highly-parallel execution of logic programs. Most of these center on
various forms of and-parallelism and/or or-parallelism. While the
majority of work in Europe and Japan seems to have focused on
or-parallel models, research in the United States had focused more on
and-parallelism. Some of the reasons for this will be examined, and a
number of models for and-parallelism and related research will be
mentioned. Then a specific model, called Restricted And-Parallelism
(RAP) will be described in detail. The discussion will focus on the
model itself, techniques for the automatic compilation of Prolog
programs into RAP graph expressions, and the proper handling of
side-effects in a parallel execution environment, and global
data-dependency analysis for better program decomposition. An overview
of RAP-related research efforts in other parts of the world will also
be discussed. Finally, topics for future research will be discussed as
time permits.
------------------------------
Date: 16 Oct 87 10:52:40 GMT
From: mcvax!cernvax!cui!pun@uunet.uu.net (PUN Thierry)
Subject: Course - Information Processing
(I am forwarding the following annoucement; please enquire directly
to the address below. TP.)
The Swiss Federal Institute of Technology, Lausanne presents a graduated
program leading to a M.S. in information processing with applications to
systems signals and images.
The closing of registrations is November 15 1987.
This program starting in March 1988 consisting of two terms study (one year)
including lectures, exercices and workshops is based on the following themes :
A) Communication system theory (160 hours)
A1) Systems theory (30 hours)
A2) Information theory (70 hours)
A3) Detection and estimation (60 hours)
B) Digital signal and image processing
B1) Digital signal processing (80 hours)
B2) Digital image processing (90 hours)
C) Pattern recognition and scene analysis (150 hours)
C1) Pattern recognition (90 hours)
C2) Scene analysis (60 hours)
D) Real time information processing (145 hours)
D1) Speech processing (60 hours)
D2) Signal processing and VLSI architecture (85 hours)
These lectures, exercices and workshops will be followed by a research
project during 6 months in 1989.
The lecturers are : M. Kunt (course director), F. Ade, M. Bellanger, D.
Bonvin, J. Caelen, G. Caelen-Haumont, G. Coray, F. de Coulon, P. Dewilde,
O. Faugeras, W. Fichtner, G. Granlund, C. Gueguen, B. Guerin, M. Hasler,
J.P. Haton, H. Hugli, R. Ingold, O. Kubler, R. Longchamp, H. Nussbaumer and
Ch. Sorin.
To get more informations please contact the secretariat du Laboratoire de
traitement des signaux de l'EPFL, Departement d'electricite, EPFL Ecublens,
CH 1015 Lausanne, SWITZERLAND, Tel. (4121) 472624 or 472601,
Telex 454062 EPFVD CH, Telefax (4121) 474660
PUN CGEUGE51 10/14/87
THIERRY PUN cvnet@yorkvm1 10/14/87 For posting on the net (start
------------------------------
End of AIList Digest
********************
