clarke@utcsri.UUCP (11/27/87)
(SF = Sandford Fleming Building, 10 King's College Road)
(GB = Galbraith Building, 35 St. George Street)
SUMMARY:
COLLOQUIUM, Tuesday, December 8, 11 am, SF1105 -- David Conrath:
"Modeling Office Systems"
A.I. SEMINAR, Tuesday, December 8, 3 pm, GB120 -- Edward Stabler:
"The Logic of Movement and Barriers"
-----------------------
COLLOQUIUM, Tuesday, December 8, 11 am, SF1105
Dr. David Conrath
University of Waterloo
"Modeling Office Systems"
The Office Support Systems Analysis and Design project (OSSAD) was launched
in January 1985 and involves researchers from Aix-en-Provence, Mitan, Mun-
ich, Rome, Toulon and Waterloo. I will discuss how it got started, its
original objectives, its present accomplishments and where it is going,
with emphasis on the modeling of office systems. I will also cover some of
the problems and benefits of international collaboration, especially when
there are a number of different cultures and disciplines involved.
A.I. SEMINAR, Tuesday, December 8, 3 pm, GB120
Professor Edward Stabler
Canadian Institute for Advanced Research
and University of Western Ontario
"The Logic of Movement and Barriers"
No natural language processing system has explicitly represented and used
any substantial part of recent Chomskian syntax. This talk will describe
an attempt to remedy that situation. We present a transparent and flexible
logical formalization of some principles of Chomsky's "Barriers" theory,
viz. the "Barriers" principles relevant to movement and bounding. Since
the proposed logical representation is as transparent as possible, it
preserves the modularity and notational simplicity of the theory itself,
and it defines exactly the class of grammatical structures covered by the
theory. The movement relations are of particular interest because their
formalization is relatively difficult, and consequently they are inade-
quately treated in most automated systems. The flexibility of the proposed
formalization is illustrated by extension of the system to allow verb rais-
ing and the amalgamation of verbs with their affixes. Since first order
proof techniques are relatively well understood, our theory can be
evaluated directly or transformed into forms that are more feasibly managed
by particular theorem provers, where the transformations are provably sound
and as complete as the intended application requires.
--
Jim Clarke -- Dept. of Computer Science, Univ. of Toronto, Canada M5S 1A4
(416) 978-4058
{allegra,cornell,decvax,linus,utzoo}!utcsri!clarke