Generation, Lambek Calculus, Montague's Semantics and Semantic Proof Nets

Most of the studies in the framework of Lambek calculus have considered the parsing process and ignored the generation process. This paper wants to rely on the close link between Lambek calculus and linear logic to present a method for the generation process with semantic proof nets. We express the process as a proof search procedure based on a graph calculus and the solutions appear as a matrix computation preserving the decidability properties, and we characterize a polynomial time case.

• Type: Conference
• Year: 2000
• Where: COLING
• Authors: Sylvain Pogodalla
• Keywords: COLING 2000, COLING 2008, Generation Process, Lambek Calculus, Semantic Proof Nets