Logical Aspects of Computational Linguistics, 2012 7th International Conference, LACL 2012, Nantes, France, July 2-4, 2012, Proceedings Theoretical Computer Science and General Issues Series
Coordonnateurs : Bechet Denis, Dikovsky Alexandre
Logical Grammars, Logical Theories.-Ludics and Natural Language: First Approaches.-The Non Cooperative Basis of Implicatures .-Movement-Generalized Minimalist Grammars.-Toward the Formulation of Presupposition by Illative Combinatory Logic .-Abstract Automata and a Normal Form for Categorial Dependency Grammars.-Importing Montagovian Dynamics into Minimalism.-CoTAGs and ACGs .-Gapping as Like-Category Coordination.-L-Completeness of the Lambek Calculus with the Reversal Operation .-Distributive Full Nonassociative Lambek Calculus with S4-Modalities Is Context-Free .-Common Nouns as Types.-Extractability as the Deduction Theorem in Subdirectional Combinatory Logic .-Agnostic Possible Worlds Semantics.-Abstract Machines for Argumentation.-On the Completeness of Lambek Calculus with Respect to Cofinite Language Models.-Dot-Types and Their Implementation.-
Fast-track conference proceedings
State-of-the-art research
Up-to-date results
Date de parution : 05-2012
Ouvrage de 251 p.
15.5x23.5 cm
Disponible chez l'éditeur (délai d'approvisionnement : 15 jours).
Prix indicatif 52,74 €
Ajouter au panierThème de Logical Aspects of Computational Linguistics :
Mots-clés :
lambda grammar; push-down automata; semantics; transductions; type theory