[Prev][Next][Index]
CSLI Calendar, Oct. 22, 3:4
-
Subject: CSLI Calendar, Oct. 22, 3:4
-
From: csli@csli.stanford.edu
-
Date: Thu 22 Oct 1987 09:09:09-PDT
C S L I C A L E N D A R O F P U B L I C E V E N T S
_____________________________________________________________________________
22 October 1987 Stanford Vol. 3, No. 4
_____________________________________________________________________________
A weekly publication of The Center for the Study of Language and
Information, Ventura Hall, Stanford University, Stanford, CA 94305
____________
CSLI ACTIVITIES FOR THIS THURSDAY, 22 October 1987
12 noon TINLunch
Ventura Hall Reading: "On Language and Connectionism:
Conference Room Analysis of a Parallel Distributed Processing
Model of Language Acquisition"
by Steven Pinker and Alan Prince
Discussion led by Dave Rumelhart
(der@psych.stanford.edu)
This TINLunch is a follow up of the seminar
that was given on 15 October. Please
see the abstract for it in last week's Calendar.
2:15 p.m. CSLI Seminar
Room G-19 External Language and Internal Representation
Redwood Hall Pat Hayes (Hayes.pa@xerox.com)
Abstract in last week's Calendar
3:30 p.m. Tea
Ventura Hall
--------------
CSLI ACTIVITIES FOR NEXT THURSDAY, 29 October 1987
12 noon TINLunch
Ventura Hall Reading: "Cognitive Significance and New Theories
Conference Room of Reference"
by John Perry
Discussion led by Bob Moore
(bmoore@sri.com)
Abstract in next week's Calendar
2:15 p.m. CSLI Seminar
Room G-19 An Introduction to Situated Automata
Redwood Hall Part I: Basic Concepts
Stan Rosenschein (Stan@warbucks.ai.sri.com)
Abstract below
3:30 p.m. Tea
Ventura Hall
--------------
NEXT WEEK'S SEMINAR
An Introduction to Situated Automata
Part I: Basic Concepts
Stan Rosenschein
October 29
This is the first of two lectures on the situated-automata approach to
the analysis and design of embedded systems. This approach seeks to
ground our understanding of embedded systems in a rigorous, objective
analysis of their informational properties, where information is
modeled mathematically in terms of correlations between states of the
system and conditions in the environment. In this talk we motivate the
general framework, present the central mathematical ideas on how
information is carried in the states of automata, and relate the
mathematical properties of the model to key theoretical issues in AI
including the nature of knowledge, its representation in machines, the
role of syntactic deduction, "nonmonotonic" reasoning, and the
relation of knowledge and action. Some general technological
implications of the approach, including reduced reliance on
conventional symbolic inference and increased opportunities for
parallelism, will be discussed.
The second lecture will describe the application of the
situated-automata perspective to specific problems arising in the
design of integrated intelligent agents, including problems of
perception, planning and action selection, and linguistic
communication.
-------