Theoretical Computer Science
A logic programming language with Lambda-abstraction, function variables, and simple unification
Proceedings of the international workshop on Extensions of logic programming
Quantifiers, Anaphora, and Intensionality
Journal of Logic, Language and Information
EACL '93 Proceedings of the sixth conference on European chapter of the Association for Computational Linguistics
Memoisation for glue language deduction and categorial parsing
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1
Polarity sensitivity and evaluation order in type-logical grammar
HLT-NAACL-Short '04 Proceedings of HLT-NAACL 2004: Short Papers
Inverse scope as metalinguistic quotation in operational semantics
JSAI'07 Proceedings of the 2007 conference on New frontiers in artificial intelligence
| Hi-index | 0.00 |
Recent work on the syntax-semantics interface (see e.g. (Dalrymple et al., 1994)) uses a fragment of linear logic as a 'glue language' for assembling meanings compositionally. This paper presents a glue language account of how negative polarity items (e.g. ever, any) get licensed within the scope of negative or downward-entailing contexts (Ladusaw, 1979), e.g. Nobody ever left. This treatment of licensing operates precisely at the syntax-semantics interface, since it is carried out entirely within the interface glue language (linear logic). In addition to the account of negative polarity licensing, we show in detail how linear-logic proof nets (Girard, 1987; Gallier, 1992) can be used for efficient meaning deduction within this 'glue language' framework.