HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

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.
Document type :
Complete list of metadata

Cited literature [15 references]  Display  Hide  Download

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Wednesday, May 24, 2006 - 10:51:46 AM
Last modification on : Friday, February 4, 2022 - 3:34:38 AM
Long-term archiving on: : Sunday, April 4, 2010 - 11:21:52 PM


  • HAL Id : inria-00072775, version 1



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



Record views


Files downloads