19.757 Haifa CS Symposium

From: Humanist Discussion Group (by way of Willard McCarty willard.mccarty_at_kcl.ac.uk>
Date: Fri, 5 May 2006 07:03:45 +0100

               Humanist Discussion Group, Vol. 19, No. 757.
       Centre for Computing in the Humanities, King's College London
                     Submit to: humanist_at_princeton.edu

         Date: Fri, 05 May 2006 06:56:30 +0100
         From: Shuly Wintner <shuly_at_cs.haifa.ac.il>
         Subject: University of Haifa Computer Science Colloquium

University of Haifa Computer Science Colloquium

You are cordially invited to attend the following talk.

Time: Wednesday, May 10th, 14:00
Place: Jacobs Building room 303
Speaker: Shalom Lappin, Department of Philosophy, King's College London
Title: Expressive Completeness and Computational Efficiency for
Underspecified Scope Representations
The tension between expressive power and computational tractability
poses an acute problem for theories of underspecified semantic
representation. In previous work we have presented an account of
underspecified scope representations within Property Theory with
Curry Typing (PTCT), an intensional first-order theory for natural
language semantics. Here we show how filters applied to the
underspecified-scope terms of PTCT permit both expressive
completeness and the reduction of computational complexity in a
significant class of non-worst case scenarios.

Joint work with Chris Fox.

Shuly Wintner
Computer Science colloquium coordinator
Received on Fri May 05 2006 - 02:23:34 EDT

This archive was generated by hypermail 2.2.0 : Fri May 05 2006 - 02:23:35 EDT