Aspects of semantic interpretation, such as quantifier scoping and reference resolution, are often realised computationally by non-monotonic operations involving loss of informati...
In natural language processing, ambiguity resolution is a central issue, and can be regarded as a preference assignment problem. In this paper, a Generalized Probabilistic Semanti...
This paper proposes a set of representations for tenses and a set of constraints on how they can be combined in adjunct clauses. The semantics we propose explains the possible mea...
In the right situation, a speaker can use an unqualified indefinite description without being misunderstood. This use of language, normal slate implicature, is a kind of conversat...
We discuss algorithms for generation within the Lambek Theorem Proving Framework. Efficient algorithms for generation in this framework take a semantics-driven strategy. This stra...