Achieving Expressive Completeness and Computational Efficiency for Underspecified Scope Representations

Abstract
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.
Keywords No keywords specified (fix it)
Categories (categorize this paper)
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index Translate to english
 
Download options
PhilPapers Archive


Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 11,412
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA

No references found.

Citations of this work BETA

No citations found.

Similar books and articles
Chris Fox & Shalom Lappin (2004). An Expressive First-Order Logic with Flexible Typing for Natural Language Semantics. Logic Journal of the Interest Group in Pure and Applied Logics 12 (2):135--168.
Analytics

Monthly downloads

Added to index

2010-12-22

Total downloads

2 ( #355,341 of 1,103,038 )

Recent downloads (6 months)

2 ( #183,252 of 1,103,038 )

How can I increase my downloads?

My notes
Sign in to use this feature


Discussion
Start a new thread
Order:
There  are no threads in this forum
Nothing in this forum yet.