Generation with Semantic Proof Nets

Sylvain Pogodalla 1
1 CALLIGRAMME - Linear logic, proof networks and categorial grammars
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : Categorial grammars and Lambek calculus found a nice embedding in Linear Logic, and a lot of work have presented proof nets uses for linguistic purposes, with a special look at proof nets for Lambek calculus. But they have mainly explored the syntactic capabilities of proof nets, describing parsing processes. We present here our vision of the generation process based on semantic proof nets. The main features of this proposal consist in the use of proof nets for lambek calculus but also for semantic recipes of lexical entries, so that no lambda-term unification occur with their limitations (undecidability from second order). Based on a graph calculus, the solutions of this process can be expressed as a matrix computation.
Type de document :
Rapport
[Research Report] RR-3878, INRIA. 2000, pp.25
Liste complète des métadonnées

Littérature citée [15 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00072775
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 10:51:46
Dernière modification le : jeudi 11 janvier 2018 - 06:19:48
Document(s) archivé(s) le : dimanche 4 avril 2010 - 23:21:52

Fichiers

Identifiants

  • HAL Id : inria-00072775, version 1

Collections

Citation

Sylvain Pogodalla. Generation with Semantic Proof Nets. [Research Report] RR-3878, INRIA. 2000, pp.25. 〈inria-00072775〉

Partager

Métriques

Consultations de la notice

235

Téléchargements de fichiers

92