Logical Aspects of Computational Linguistics

First International Conference, LACL '96, Nancy, France, September 23-25, 1996. Selected Papers

AvChristian Retore

Häftad, Engelska, 1997

Del i serien Lecture Notes in Computer Science

566 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

This book constitutes the strictly refereed post-conference proceedings of the First International Conference on Logical Aspects of Computational Linguistics, LACL '96, held in Nancy, France in April 1996.The volume presents 18 revised full papers carefully selected and reviewed for inclusion in the book together with four invited contributions by leading authorities and an introductory survey with a detailed bibliography. The papers cover all relevant logical aspects of computational linguistics like logical inference, grammars, logical semantics, natural language processing, formal proofs, logic programming, type theory, etc.

Produktinformation

Utgivningsdatum:1997-10-15
Mått:155 x 235 x undefined mm
Vikt:680 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:442
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783540637004

Utforska kategorier

Systemvetenskap och AI inom Data och IT

Innehållsförteckning

Logical aspects of computational linguistics: An introduction.- Partial proof trees, resource sensitive logics and syntactic constraints.- Inessential features.- Linear logic as logic programming: An abstract.- Derivational minimalism.- Tree adjoining grammars in noncommutative linear logic.- Constructing different phonological bracketings from a proof net.- Vagueness and type theory.- A natural language explanation for formal proofs.- Models for polymorphic Lambek Calculus.- Sloopy Identity.- A family of decidable feature logics which support HPSG-style set and list constructions.- Language understanding: A procedural perspective.- The automatic deduction of classificatory systems from linguistic theories (abridged).- A belief-centered treatment of pragmatic presupposition.- Connected sets of types and categorial consequence.- Generation as deduction on labelled proof nets.- Semilinearity as a syntactic invariant.- Quantitative constraint logic programming for weighted grammar applications.- Strict LT2 : Regular :: Local : Recognizable.- Pomset Logic and variants in natural languages.- Constraint logic programming for computational linguistics.- Representation theorems for residuated groupoids.