LACL 2011

LACL 2011

June 29, 30, July 1 2011

June 29, 30, July 1 2011

Logical Aspects of Computational Linguistics

LACL 2011 Accepted Papers

Richard Zuber. Some generalised comparative determiners
NoƩmie-Fleur Sandillon-Rezer and Richard Moot. Using tree transducers for grammatical inference
Carlos Areces, Santiago Figueira and Daniel Gorin. Using Logic in the Generation of Referring Expressions
Arno Bastenhof. Polarized Classical Non-associative Lambek Calculus and Formal Semantics
Zhaohui Luo. Contextual Analysis of Word Meanings in Type-Theoretical Semantics
Ryo Yoshinaka and Makoto Kanazawa. Distributional Learning of Abstract Categorial Grammars
Yuri Ozaki and Daisuke Bekki. Conditional Logic Cb and its Tableau System
Thomas Graf. Closure Properties of Minimalist Derivation Tree Languages
Jeroen Bransen. The product-free Lambek-Grishin calculus is NP-complete
Sai Qian and Maxime Amblard. Event in Compositional Dynamic Semantics
Staffan Larsson. Do Dialogues Have Content?
Denis Bechet, Alexander Dikovsky and Annie Foret. On Dispersed and Choice Iteration in Incrementally Learnable Dependency Types
Glyn Morrill. Logic Programming of the Displacement Calculus
Makoto Kanazawa, Jens Michaelis, Sylvain Salvati and Ryo Yoshinaka. Well-Nestedness Properly Subsumes Strict Derivational Minimalism
Gregory Kobele. Minimalist Tree Languages are closed under intersection with recognizable tree languages
Maxime Amblard. Encoding Phases using Commutativity and Non-commutativity in a Logical Framework
Robin Cooper. Copredication, quantification and frames
Carl Pollard. Are (Linguist's) Propositions Topos Propositions?