This book introduces fundamental techniques for computing semantic representations for
fragments of natural language and performing inference with the result. The prinary tools …

The aim of computational semantics is to capture the meaning of natural language
expressions in representations suitable for performing inferences, in the service of …

This paper presents the Constraint Language for Lambda Structures (CLLS), a first-order
language for semantic underspecification thatconservatively extends dominance constraints …

This thesis is concerned with the syntax, compositional semantics and contextually-situated
interpretation of a certain kind of non-sentential utterance occuring in dialogue, namely one …

By “reinterpretation” Egg means to include various phenomena hitherto treated separately:
metonymy (Amelie labeled the wine, ie, bottles of wine; All the tenors are on the top shelf, ie …

In this article we discuss what constitutes a good choice of semantic representation,
compare different approaches of constructing semantic representations for fragments of …

Verbs like begin may take either a VP or an NP complement, but their meaning is pretty
similar in both cases, eg for begin, the start of an eventuality is at stake. Pustejovsky's …

Dominance constraints are logical descriptions of trees that are widely used in
computational linguistics. Their general satisfiability problem is known to be NP-complete …

Interaction Grammars (IG) are a new linguistic formalism which is based on descriptions of
underspecified trees in the framework of intuitionistic linear logic (ILL). Ëyntactic …

Dominance constraints for finite tree structures are widely used in several areas of
computational linguistics including syntax, semantics, and discourse. In this paper, we …