|
|
|||
|
||||
OverviewEdited 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. Full Product DetailsAuthor: Denis Bechet , Alexandre DikovskyPublisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K Edition: 2012 ed. Volume: 7351 Dimensions: Width: 15.50cm , Height: 1.40cm , Length: 23.50cm Weight: 0.409kg ISBN: 9783642312618ISBN 10: 3642312616 Pages: 251 Publication Date: 30 May 2012 Audience: Professional and scholarly , Professional and scholarly , Professional & Vocational , Professional & Vocational Format: Paperback Publisher's Status: Active Availability: Manufactured on demand We will order this item for you from a manufactured on demand supplier. Table of ContentsLogical 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.-ReviewsAuthor InformationTab Content 6Author Website:Countries AvailableAll regions |