Quantity implicatures in extended logic programming

Abstract

This paper describes a formalization of quantity implicatures using extended logic programming. In this approach an implicature example is translated into a logic program and from the WFSX semantics of this program quantity implicatures are derived. This formalization provides the insight that scalar implicatures are computationally more complex than exhaustivity implicatures. Furthermore, the approach has a close connection to one using circumscription as in van Rooij and Schulz 2004.