Logical aspects of computational linguistics : first international conference, LACL '96, Nancy, France, April 1996 : selected papers
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...
Salvato in:
| Ente Autore: | |
|---|---|
| Altri autori: | |
| Natura: | Livre numérique |
| Lingua: | Anglais |
| Pubblicazione: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Serie: | Lecture notes in computer science. Lecture notes in artificial intelligence
1328 |
| Soggetti: | |
| Accesso online: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Logical aspects of computational linguistics, first international conference, LACL '96, Nancy, France, April 1996, selected papers, Christian Retore (ed.), 1997, Berlin, Springer, 1 vol. (VIII-434 p.), Lecture notes in computer science, 3-540-63700-1 • Logical Aspects of Computational Linguistics, Texte imprimé, 9783662189542 |
Sommario:
- 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.