Labelled Proof Nets for the Syntax and Semantics of Natural Languages - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Logic Journal of the IGPL Year : 1999

Labelled Proof Nets for the Syntax and Semantics of Natural Languages

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.
Not file

Dates and versions

inria-00099011 , version 1 (26-09-2006)

Identifiers

  • HAL Id : inria-00099011 , version 1

Cite

Guy Perrier. Labelled Proof Nets for the Syntax and Semantics of Natural Languages. Logic Journal of the IGPL, 1999, 7 (5), pp.629-654. ⟨inria-00099011⟩
112 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More