,

Logical Aspects of Computational Linguistics

7th International Conference, LACL 2012, Nantes, France, July 2-4, 2012, Proceedings

Specificaties
Paperback, 251 blz. | Engels
Springer Berlin Heidelberg | 2012e druk, 2012
ISBN13: 9783642312618
Rubricering
Springer Berlin Heidelberg 2012e druk, 2012 9783642312618
Onderdeel van serie Lecture Notes in Computer Science
Verwachte levertijd ongeveer 9 werkdagen

Samenvatting

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.

Specificaties

ISBN13:9783642312618
Taal:Engels
Bindwijze:paperback
Aantal pagina's:251
Uitgever:Springer Berlin Heidelberg
Druk:2012

Inhoudsopgave

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

Rubrieken

    Personen

      Trefwoorden

        Logical Aspects of Computational Linguistics