Logical Aspects of Computational Linguistics: First International Conference, LACL '96 Nancy, France, September 23–25, 1996 Selected Papers

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

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.

Author(s): Patrick Blackburn, Marc Dymetman (auth.), Christian Retoré (eds.)
Series: Lecture Notes in Computer Science 1328 : Lecture Notes in Artificial Intelligence
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 1997

Language: English
Pages: 442
Tags: Mathematical Logic and Formal Languages; Logics and Meanings of Programs; Artificial Intelligence (incl. Robotics)

Logical aspects of computational linguistics: An introduction....Pages 1-20
Partial proof trees, resource sensitive logics and syntactic constraints....Pages 21-42
Inessential features....Pages 43-62
Linear logic as logic programming: An abstract....Pages 63-67
Derivational minimalism....Pages 68-95
Tree adjoining grammars in noncommutative linear logic....Pages 96-117
Constructing different phonological bracketings from a proof net....Pages 118-133
Vagueness and type theory....Pages 134-148
A natural language explanation for formal proofs....Pages 149-167
Models for polymorphic Lambek Calculus....Pages 168-187
Sloopy Identity....Pages 188-207
A family of decidable feature logics which support HPSG-style set and list constructions....Pages 208-227
Language understanding: A procedural perspective....Pages 228-247
The automatic deduction of classificatory systems from linguistic theories (abridged)....Pages 248-273
A belief-centered treatment of pragmatic presupposition....Pages 274-291
Connected sets of types and categorial consequence....Pages 292-309
Generation as deduction on labelled proof nets....Pages 310-328
Semilinearity as a syntactic invariant....Pages 329-345
Quantitative constraint logic programming for weighted grammar applications....Pages 346-365
Strict LT 2 : Regular :: Local : Recognizable....Pages 366-385
Pomset Logic and variants in natural languages....Pages 386-405
Constraint logic programming for computational linguistics....Pages 406-425
Representation theorems for residuated groupoids....Pages 426-434