Dikovsky / Bechet | Logical Aspects of Computational Linguistics | Buch | 978-3-642-31261-8 | sack.de

Buch, Englisch, 251 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 406 g

Reihe: Theoretical Computer Science and General Issues

Dikovsky / Bechet

Logical Aspects of Computational Linguistics

7th International Conference, LACL 2012, Nantes, France, July 2-4, 2012, Proceedings
2012
ISBN: 978-3-642-31261-8
Verlag: Springer

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

Buch, Englisch, 251 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 406 g

Reihe: Theoretical Computer Science and General Issues

ISBN: 978-3-642-31261-8
Verlag: Springer


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.

Dikovsky / Bechet Logical Aspects of Computational Linguistics jetzt bestellen!

Zielgruppe


Research

Weitere Infos & Material


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



Ihre Fragen, Wünsche oder Anmerkungen
Vorname*
Nachname*
Ihre E-Mail-Adresse*
Kundennr.
Ihre Nachricht*
Lediglich mit * gekennzeichnete Felder sind Pflichtfelder.
Wenn Sie die im Kontaktformular eingegebenen Daten durch Klick auf den nachfolgenden Button übersenden, erklären Sie sich damit einverstanden, dass wir Ihr Angaben für die Beantwortung Ihrer Anfrage verwenden. Selbstverständlich werden Ihre Daten vertraulich behandelt und nicht an Dritte weitergegeben. Sie können der Verwendung Ihrer Daten jederzeit widersprechen. Das Datenhandling bei Sack Fachmedien erklären wir Ihnen in unserer Datenschutzerklärung.