@InProceedings{Bodirsky_et_al:2001_1,
AUTHOR = {Bodirsky, Manuel and Erk, Katrin and Koller, Alexander and Niehren, Joachim},
TITLE = {Underspecified Beta Reduction},
YEAR = {2001},
BOOKTITLE = {Proceedings of the 39th Annual Meeting of the Association of Computational Linguistics (ACL'01), July 611},
PAGES = {7481},
ADDRESS = {Toulouse, France},
URL = {ftp://ftp.ps.unisb.de/pub/papers/ProgrammingSysLab/uspbeta.ps.gz http://www.coli.unisb.de/~koller/papers/uspbeta.ps.gz},
ABSTRACT = {For ambiguous sentences, traditional semantics construction produces large numbers of higherorder formulas, which must then be betareduced individually. Underspecified versions can produce compact descriptions of all readings, but it is not known how to perform beta reduction on these descriptions. We show how to do this using beta reduction constraints in the constraint language for $lambda$structures (CLLS).},
ANNOTE = {COLIURL : Bodirski:2001:UBR.pdf Bodirsky:2001:UBR.ps} }
