HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

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.
Complete list of metadata

Cited literature [15 references]  Display  Hide  Download

https://hal.inria.fr/inria-00098490
Contributor : Sylvain Pogodalla Connect in order to contact the contributor
Submitted on : Wednesday, December 13, 2006 - 1:59:45 PM
Last modification on : Friday, February 4, 2022 - 3:30:46 AM
Long-term archiving on: : 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. 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⟩

Share

Metrics

Record views

99

Files downloads

135