[Prev][Next][Index]
CSLI Calendar, April 14, 3:24
-
Subject: CSLI Calendar, April 14, 3:24
-
From: csli@csli.stanford.edu
-
Date: Wed 13 Apr 1988 17:05:32 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
_____________________________________________________________________________
14 April 1988 Stanford Vol. 3, No. 24
_____________________________________________________________________________
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, 14 April 1988
12 noon TINLunch
Ventura Hall Reading: "Language and Interpretation:
Seminar Room Philosophical Reflections and Empirical Inquiry."
by Noam Chomsky
Discussion led by Sylvain Bromberger
(sylvain@csli.stanford.edu)
Abstract in last week's Calendar
2:15 p.m. CSLI Seminar
Cordura Hall On Acting Together: Joint Intentions for
Conference Room Intelligent Agents
Phil Cohen
(pcohen@ai.sri.com)
Abstract in last week's Calendar
3:30 p.m. Tea
Ventura Hall
--------------
CSLI ACTIVITIES FOR NEXT THURSDAY, 21 April 1988
12 noon TINLunch
Ventura Hall Reading: "The Semantics of Clocks"
Seminar Room by Brian Cantwell Smith
Discussion led by Pat Hayes
(hayes.pa@xerox.com)
Abstract below
2:15 p.m. CSLI Seminar
Cordura Hall Connections between Linguistics and Computer Science:
Conference Room Some Topics in the Mathematics of Language
Bill Rounds
(rounds@csli.stanford.edu)
Abstract below
3:30 p.m. Tea
Ventura Hall
--------------
NEXT WEEK'S CSLI TINLUNCH
Reading: "The Semantics of Clocks"
by Brian Cantwell Smith
In Aspects of Intelligence, J. H. Fetzer (ed.), 1988.
Discussion led by Pat Hayes
(hayes.pa@xerox.com)
April 21
Brian Smith's paper draws an analogy between clocks and deduction
engines, and develops a semantics in which one can integrate a
semantic function. I will argue that a better approach is a rather
simpler one in which a clock is more like a measuring stick, and show
how the semantic equations separate naturally into a dynamic
part---where all the calculus applies---and the interpretation
function---which is just vanilla.
--------------
NEXT WEEK'S CSLI SEMINAR
Connections between Linguistics and Computer Science:
Some Topics in the Mathematics of Language
Bill Rounds
(rounds@csli.stanford.edu)
University of Michigan
CSLI and Xerox PARC
April 21
In this talk I will discuss some similarities and analogies between
grammar formalisms, situation theory, database theory, and the modal
logic of programs. The focus of the talk will be on a simple graphical
representation of linguistic structures, essentially as state graphs
of nondeterministic finite automata, and I will describe several kinds
of logical statements useful for speaking about these structures. When
a construct for specifying structures recursively is added to the
basic logic, one obtains a fairly powerful declarative mechanism
similar to Prolog.
Unification of the extended structures can be thought of as forming
a join operation in a suitable ordering of the structures. It turns
out that in one such ordering, unification corresponds to taking the
join of database relations. This ordering has also proved useful in
the specification of concrete data types.
Most of the talk will consist of examples and pictures, and only a
nodding familiarity with any of the above topics will be presumed.