’s glue logic for computing logical form dynamic. This allows us to model a dialogue agent’s understanding of what the update of the semantic representation of the dialogue would be after his next contribution, including the effects of the rhetorical moves that he is contemplating performing next. This is a pre-requisite for developing a model of how agents reason about what to say next. We make the glue logic dynamic by using a dynamic public announcement logic ( pal ). We (...) extend pal with a particular variety of default reasoning suited to reasoning about discourse—this default reasoning being an essential component of inferring the pragmatic effects of one’s dialogue moves. We add to the pal language a new type of announcement, known as ceteris paribus announcement, and this is used to model how an agent anticipates the (default) pragmatic effects of his next dialogue move. Our extended pal validates certain intuitive patterns of default inference that existing pal s for practical reasoning do not. We prove that the dynamic glue logic has a pspace validity problem, and as such is no more complex than pal with multiple $${\square}$$ operators. (shrink)

In this paper, we investigate the representation of negated sentences in Minimal Recursion Semantics (Copestake, Flickinger, Pollard, & Sag, 2005). We begin with its treatment in the English Resource Grammar (Flickinger, 2000, 2011), a broad-coverage implemented HPSG (Pollard & Sag, 1994), and argue that it is largely a suitable representation for English, despite possible objections. We then explore whether it is suitable for typologically different languages: namely, those that express sentential negation via inflection on the verb, particularly Turkish and Inuktitut. (...) We find that the interaction between negation and intersective modifiers requires a change to the way in which (at least) one of them contributes to semantic composition, and we argue for adapting the analysis of intersective modifiers. (shrink)

Interdisciplinary investigations marry the methods and concerns of different fields. Computer science is the study of precise descriptions of finite processes; semantics is the study of meaning in language. Thus, computational semantics embraces any project that approaches the phenomenon of meaning by way of tasks that can be performed by following definite sets of mechanical instructions. So understood, computational semantics revels in applying semantics, by creating intelligent devices whose broader behavior fits the meanings of utterances, and not just their form. (...) IBM’s Watson (Ferrucci, Brown, Chu-Carroll, Fan, Gondek, Kalyanpur, Lally, Murdock, Nyberg, Prager, Schlaefer & Welty 2010) is a harbinger of the excitement and potential of this technology. (shrink)

One way to construct semantic representations in a robust manner is to enhance shallow language processors with semantic components. Here, we provide a model theory for a semantic formalism that is designed for this, namely Robust Minimal Recursion Semantics (RMRS). We show that RMRS supports a notion of entailment that allows it to form the basis for comparing the semantic output of different parses of varying depth.