Alain Lecomte and Christian Retore. Words as modules: a lexicalised grammar in the framework of linear logic proof nets. In Carlos Martin-Vide, editor, Mathematical and Computational Analysis of Natural Language | selected papers from ICML`96, volume 45 of Studies in Functional and Structural Linguistics, pages 129-144. John Benjamins publishing company, 1998. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Lexicalized Proof-Nets and TAGs - Pogodalla (Correct)
....P A jB 1 P (B 2 Omega; Moreover, we always set the R partial order relation to #. In addition to logical formulas, we also decorate proof nets with labels from a finite set of terminal symbols. Then, as a restriction of the lexicalized intuitionistic labeled proof nets defined in [LR96], we define: Definition 7. 1. Output: An output is either a B edge that is labeled by a positive atom or the conclusion of a par link between two atoms dual one from another (we call such a conclusion a par gate) 2. Intuitionistic proof net: An intuitionistic proof net (IPN) is a proof net ....
Alain Lecomte and Christian Retore. Words as modules: a lexicalised grammar in the framework of linear logic proof nets. In International Conference on Mathematical Linguistics, Tarragona, Spain, 1996. John Benjamins.
Logical Aspects of Computational Linguistics: an.. - Blackburn, Dymetman.. (1997) (3 citations) Self-citation (Lecomte Retor) (Correct)
....as local relations in initial Proof Trees. The authors also discuss the differences and proximities between their approach in the setting of Partial Proof Trees and the Proof Net approach, as they call the formalisms advocated in the paper by Abrusci et al. as well as by Lecomte and Retor [78,79]. The latter viewpoint is reflected in another paper Pomset logic and variants in natural languages by Irene SCHENA. The author proposes another view on combining proofs by means of Pomset Logic, an extension of Linear Logic made by Retor [99,101] The main difference with Abrusci et al. resides ....
....with a non commutative self dual connective. Then one has to generalise slightly the notion of a Lambek grammar: the lexicon should associate partial proofs (partial proof nets in fact) to the words, and parsing consists in combining them into a complete proof as done by Lecomte and Retor in [78,79] and pursued by Schena in this volume. Models for polymorphic Lambek calculus by Martin EMMS reviews truth value models for Lambek calculus, and then defines a notion of model for the second order Lambek calculus. Then the author establishes that this semantics is complete with respect to second ....
Alain Lecomte and Christian Retoré. Words as modules: a lexicalised grammar in the framework of linear logic proof nets. In Carlos Martin-Vide, editor, International Conference on Mathematical Linguistics II. John Benjamins, Amsterdam, 1997.
Incremental Parsing Of Lambek Calculus Using Proof-Net.. - Denis Echet Irisa (2003) (Correct)
No context found.
Alain Lecomte and Christian Retore. Words as modules: a lexicalised grammar in the framework of linear logic proof nets. In Carlos Martin-Vide, editor, Mathematical and Computational Analysis of Natural Language | selected papers from ICML`96, volume 45 of Studies in Functional and Structural Linguistics, pages 129-144. John Benjamins publishing company, 1998.
Pomset Logic and Variants in Natural Languages - Schena (Correct)
No context found.
A. Lecomte, C. Retor'e. Words as Modules: a Lexicalised Grammar in the Framework of Linear Logic Proof nets. In International Conference on Mathematical Linguistics, ICML'96, edited C. Martin Vide. To be published in 1997 by John Benjamins.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC