Logical Aspects of Computational Linguistics

7th International Conference, LACL 2012, Nantes, France, July 2-4, 2012, Proceedings
Herausgegeben:Bechet, Denis; Dikovsky, Alexandre

• Broschiertes Buch

Produktbeschreibung

Edited in collaboration with FoLLI, the Association of Logic, Language and Information, this book constitutes the refereed proceedings of the 7th International Conference on Logical Aspects of Computational Linguistics, LACL 2012, held in Nantes, France, in July 2012.The 15 revised full papers presented together with 2 invited talks were carefully reviewed and selected from 24 submissions. The papers are organized in topical sections on logical foundation of syntactic formalisms, logics for semantics of lexical items, sentences, discourse and dialog, applications of these models to natural language processing, type theoretic, proof theoretic, model theoretic and other logically based formal methods for describing natural language syntax, semantics and pragmatics, as well as the implementation of natural language processing software relying on such methods.

---

Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.

Produktdetails

• Theoretical Computer Science and General Issues 7351
• Verlag: Springer / Springer Berlin Heidelberg / Springer, Berlin
• Artikelnr. des Verlages: 978-3-642-31261-8
• 2012
• Seitenzahl: 264
• Erscheinungstermin: 30. Mai 2012
• Englisch
• Abmessung: 235mm x 155mm x 15mm
• Gewicht: 414g
• ISBN-13: 9783642312618
• ISBN-10: 3642312616
• Artikelnr.: 35920644

Inhaltsangabe

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.-