No subject

[wsavitch@UCSD.EDU]

The Workshop on Mathematics of Language will take  place  on
May  17 and 18 in The Tarrytown Hilton Inn in Tarrytown, New
York (just outside of Yorktown Heights, N.Y).  The  workshop
will  begin  at  9:30  am on May 17 and end at approximately
6:30 pm on May 18.
 
Please note that attendance will be restricted to 80  parti-
cipants.  Registration will be on a first come, first served
basis.   To   preregister   please   send    a    note    to
MOL2 at WATSON.IBM.COM with the following information:
 
  :name.
  :institution.
  :e-mail.
  :phone.
 
If we have not run out of space by then, you will  be  asked
to send in a check for $40 (registration at the door will be
$50).  All payments will have to be by check.
 
The address of the hotel is:
 
The Tarrytown Hilton Inn
455 South Broadway
Tarrytown, New York 10591
 
The price of a room is $99/night.
 
To reserve a room please call: 914-631-5700 or 1-800-HILTONS
    and refer to:   Association for Computational Linguistics
    Special Interest Group on the Mathematics of Language
 
The hotel will provide instructions on how to get there.
 
 
If you have any questions, please contact:
 
      Lisa Braden-Harder
      (MOL 2 -- Local  Arrangements)
      e-mail:  MOL2 at WATSON.IBM.COM
      tel. (914) 784-7849
 
                      PROGRAM SCHEDULE
 
                    FRIDAY, MAY 17, 1991
 
9:30   A. Manaster-Ramer
       Opening Address (Capacity, Complexity, and Beyond)
 
10:00  A. Kornai
       The Generative Power of Feature Geometry
 
10:30  BREAK
 
10:50  J. O'Neil
       The Generation of the Elementary Tree Set for a
       Tree-Adjoining Grammar
 
11:20  Mona Singh
       The Perfective Aspect: An Algebraic Analysis
 
11:50  N. Correa
       Attribute and Unification Grammar:
       A Review and Analysis of Formalisms
 
12:20  LUNCH
 
1:45   D. Radzinski
       Chinese Distributive Numerals and Indexed Grammars
 
2:15   Munidar Singh
       Towards a Formal Semantics for Speech Acts
 
2:45   BREAK
 
3:15   M. A. Moshier
       On Completeness Theorems for Feature Logics
 
3:45   E. Ristad
       On the Complexity of Two Problems in Human Language
 
4:15   BREAK
 
4:35   A. Joshi and Y. Schabes
       Fixed and Flexible Phrase Structure:
       Coordination in Tree Adjoining Grammars
 
5:05   DINNER
 
7:30   M. Dymetman
       A Generalized Greibach Normal Form for Definite Clause
       Grammars and the Decidability of the Offline-Parsability
       Problem
 
8:00   J. Nerbonne
       A Feature-Based Syntax/Semantics Interface
 
8:30   D. Johnson & L. Moss
       Languages Generated by Multistratal Axiomatic Grammars
 
                   SATURDAY, MAY 18, 1991
 
9:30   R. Berwick
       Asymptotic Computational Complexity and Average Case
       Computational Complexity for Natural Language Analysis
 
10:00  R. Zuber
       An Algebraic Approach to Negation
 
10:30  BREAK
 
10.50  S. Zeitman
       Somewhat Finite Approaches to Infinite Sentences