Lexicalized Proof-Nets in Pomset Logic & TAG - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 1998

Lexicalized Proof-Nets in Pomset Logic & TAG


This result gives a simple representation (the cut rule represents both substitution and adjunction rules) of TAGs in pomset logic. It consists in the maping of pieces of proofs to every elementary tree. A first consequence is to characterize the expressive power of the grammars defined by Lecomte and Retoré ("Pomset Logic as an Alternative Categorial Grammar",1995) in showing that a very restricted fragment allows the representation of TAGs. A second consequence is to bind more easily TAGs and Montague's semantics thanks to the logical type of these pomset grammars.
Fichier principal
Vignette du fichier
pogodalla-lacl98.pdf (294.79 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

inria-00098490 , version 1 (13-12-2006)



Sylvain Pogodalla. Lexicalized Proof-Nets in Pomset Logic & TAG. Logical Aspects of Computational Linguistics: Third International Conference, LACL’98 Grenoble, France, December 14–16, 1998 Selected Papers, 1998, Grenoble, France. pp.230-250, ⟨10.1007/3-540-45738-0_14⟩. ⟨inria-00098490⟩
101 View
147 Download



Gmail Facebook Twitter LinkedIn More