Generation, Lambek calculus, Montague's semantics and semantic proof nets

Authors:
Sylvain Pogodalla
Affiliations:
Xerox Research Centre Europe, Meylan, France
Venue:
COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 2
Year:
2000

Citing 4
Cited 2

Linear logic

Theoretical Computer Science
Geometry of interaction III: accommodating the additives

Proceedings of the workshop on Advances in linear logic
Generation as Deduction on Labelled Proof Nets

LACL '96 Selected papers from the First International Conference on Logical Aspects of Computational Linguistics
Games Semantics for Full Propositional Linear Logic

LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science

Towards abstract categorial grammars

ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
A datalog recognizer for almost affine λ-CFGs

MOL'11 Proceedings of the 12th biennial conference on The mathematics of language

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.