MoL-2007-06: Formalizing Implicatures Using Extended Logic Programming

MoL-2007-06: de Vries, Gerben (2007) Formalizing Implicatures Using Extended Logic Programming. [Report]

[thumbnail of Full Text]
Text (Full Text)

Download (490kB) | Preview
[thumbnail of Abstract] Text (Abstract)

Download (810B)


In this thesis a successful formalization of implicatures using
extended logic programming is given. This provides a cognitively more
interesting account than traditional formalizations. Focus lies on the
class of Q-implicatures, but I-implicatures are dealt with as
well. The thesis also includes an equivalence proof between this
approach and one using circumscription, such as sketched in Van Rooij
and Schulz. The main conclusion is the difference in complexity
between 'exhaustivity' and scalar implicatures, the latter type is
harder to compute. This is evidence in favor of the psycholinguistic
theory that (scalar) implicatures are only computed in the right
context, since they require extra processing.

Item Type: Report
Report Nr: MoL-2007-06
Series Name: Master of Logic Thesis (MoL) Series
Year: 2007
Date Deposited: 12 Oct 2016 14:38
Last Modified: 12 Oct 2016 14:38

Actions (login required)

View Item View Item