Labelled Proof Nets for the Syntax and Semantics of Natural Languages

Guy Perrier 1
1 CALLIGRAMME - Linear logic, proof networks and categorial grammars
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : We propose to represent the syntax and semantics of natural languages with labelled proof nets in the implicative fragment of intuitionistic linear logic. Resource-sensitivity of linear logic is used to express all dependencies between the syntactic constituents of a sentence in the form of a proof net. Phonological and semantic labelling of the proof net from its inputs to the unique output are used to produce the well-formed phonological form and the semantic representation of a sentence from entries of a lexicon. In this way we obtain a linguistic model of great flexibility because labelling is not completely determined logically: it is used to introduce linguistic constraints which go beyond the underlying logic.
Type de document :
Article dans une revue
Logic Journal of the IGPL, Oxford University Press (OUP), 1999, 7 (5), pp.629-654
Liste complète des métadonnées

https://hal.inria.fr/inria-00099011
Contributeur : Publications Loria <>
Soumis le : mardi 26 septembre 2006 - 08:41:22
Dernière modification le : jeudi 11 janvier 2018 - 06:19:48

Identifiants

  • HAL Id : inria-00099011, version 1

Collections

Citation

Guy Perrier. Labelled Proof Nets for the Syntax and Semantics of Natural Languages. Logic Journal of the IGPL, Oxford University Press (OUP), 1999, 7 (5), pp.629-654. 〈inria-00099011〉

Partager

Métriques

Consultations de la notice

250