Strong and weak quantifiers in focused NLCL

Wen Kokke

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We propose an improvement of Barker and Shan’s [4] NLCL for which derivability is decidable, which has a normal-form for proof search, can analyse scope islands, and distinguish between strong and weak quantifiers.

Original languageEnglish
Title of host publicationLogical Aspects of Computational Linguistics
Subtitle of host publicationCelebrating 20 Years of LACL (1996–2016) - 9th International Conference, LACL 2016, Proceedings
EditorsChristian Retoré, Maxime Amblard, Philippe de Groote, Sylvain Pogodalla
PublisherSpringer
Pages134-148
Number of pages15
ISBN (Print)9783662538258, 3662538253
DOIs
Publication statusPublished - 10 Nov 2016
Externally publishedYes
Event9th International Conference on Logical Aspects of Computational Linguistics - Loria building, Inria Nancy - Grand-Est, Nancy, France
Duration: 5 Dec 20167 Dec 2016
Conference number: 9
http://lacl.gforge.inria.fr/lacl-2016/index-presentation.html

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume10054 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference9th International Conference on Logical Aspects of Computational Linguistics
Abbreviated titleLACL 2016
Country/TerritoryFrance
CityNancy
Period5/12/167/12/16
Internet address

Keywords / Materials (for Non-textual outputs)

  • Categorial grammar
  • Focusing
  • Indefinite scope
  • Scope Islands

Fingerprint

Dive into the research topics of 'Strong and weak quantifiers in focused NLCL'. Together they form a unique fingerprint.

Cite this