3532 articles – 5253 references  [version française]

inria-00098490, version 1

Lexicalized Proof-Nets in Pomset Logic & TAG

Sylvain Pogodalla () a, 1

Logical Aspects of Computational Linguistics 2014 (1998) 230-250

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.

  • a –  INPL
  • 1:  CALLIGRAMME (INRIA Lorraine - LORIA)
  • INRIA – CNRS : UMR7503 – Université Henri Poincaré - Nancy I – Université Nancy II – Institut National Polytechnique de Lorraine (INPL)
  • Domain : Computer Science/Artificial Intelligence
    Computer Science/Logic in Computer Science
  • Keywords : proof-nets – non-commutative linear logic – tree adjoining grammars || réseaux de preuve – logique linéaire non commutative – grammaires d'arbre adjoints
  • Internal note : 98-R-291 || pogodalla98a
  • Comment : Colloque avec actes et comité de lecture./http://www.springerlink.com/content/fwnnfkg1te8q/
 
  • inria-00098490, version 1
  • http://hal.inria.fr/inria-00098490
  • oai:hal.inria.fr:inria-00098490
  • From: Sylvain Pogodalla <>
  • Submitted on: Wednesday, 13 December 2006 13:59:45
  • Updated on: Friday, 5 October 2012 10:27:03