Skip to Main content Skip to Navigation
Journal articles

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.
Document type :
Journal articles
Complete list of metadatas

https://hal.inria.fr/inria-00099011
Contributor : Publications Loria <>
Submitted on : Tuesday, September 26, 2006 - 8:41:22 AM
Last modification on : Thursday, January 11, 2018 - 6:19:48 AM

Identifiers

  • 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⟩

Share

Metrics

Record views

279