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 language | English |
---|---|
Title of host publication | Logical Aspects of Computational Linguistics |
Subtitle of host publication | Celebrating 20 Years of LACL (1996–2016) - 9th International Conference, LACL 2016, Proceedings |
Editors | Christian Retoré, Maxime Amblard, Philippe de Groote, Sylvain Pogodalla |
Publisher | Springer |
Pages | 134-148 |
Number of pages | 15 |
ISBN (Print) | 9783662538258, 3662538253 |
DOIs | |
Publication status | Published - 10 Nov 2016 |
Externally published | Yes |
Event | 9th International Conference on Logical Aspects of Computational Linguistics - Loria building, Inria Nancy - Grand-Est, Nancy, France Duration: 5 Dec 2016 → 7 Dec 2016 Conference number: 9 http://lacl.gforge.inria.fr/lacl-2016/index-presentation.html |
Publication series
Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Volume | 10054 LNCS |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Conference
Conference | 9th International Conference on Logical Aspects of Computational Linguistics |
---|---|
Abbreviated title | LACL 2016 |
Country/Territory | France |
City | Nancy |
Period | 5/12/16 → 7/12/16 |
Internet address |
Keywords / Materials (for Non-textual outputs)
- Categorial grammar
- Focusing
- Indefinite scope
- Scope Islands