Lexicalized Proof-Nets in Pomset Logic & TAG

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 : 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.
Liste complète des métadonnées

Cited literature [15 references]  Display  Hide  Download

https://hal.inria.fr/inria-00098490
Contributor : Sylvain Pogodalla <>
Submitted on : Wednesday, December 13, 2006 - 1:59:45 PM
Last modification on : Tuesday, January 30, 2018 - 10:23:30 AM
Document(s) archivé(s) le : Monday, April 5, 2010 - 11:28:14 PM

File

pogodalla-lacl98.pdf
Publisher files allowed on an open archive

Identifiers

Collections

Citation

Sylvain Pogodalla. Lexicalized Proof-Nets in Pomset Logic & TAG. Michael Moortgat. Logical Aspects of Computational Linguistics: Third International Conference, LACL’98 Grenoble, France, December 14–16, 1998 Selected Papers, 1998, Grenoble, France. Springer, 2014, pp.230-250, 1998, Lecture Notes in Computer Science. 〈http://link.springer.com/10.1007/3-540-45738-0_14〉. 〈10.1007/3-540-45738-0_14〉. 〈inria-00098490〉

Share

Metrics

Record views

160

Files downloads

120