From Semantic Graphs to Logic Formulae - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2009

From Semantic Graphs to Logic Formulae


We present a general two-step algorithm which transforms a graph expressing the semantic dependencies between the words of an utterance into logic formulae representing the different semantic interpretations of the utterance. The algorithm focuses on the scopal elements of the utterance, i.e. quantifiers and scopal predicates. First, the scope of every scopal element is computed as a subgraph of the whole graph, given an order on these elements. Second, we use these scopes with their order to build a logic formula incrementally from the most internal to the most external scopal elements.
Fichier principal
Vignette du fichier
PerrierMoreyAmblardEACL09.pdf (120.4 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00415793 , version 1 (11-09-2009)


  • HAL Id : inria-00415793 , version 1


Guy Perrier, Mathieu Morey, Maxime Amblard. From Semantic Graphs to Logic Formulae. [Research Report] 2009, pp.9. ⟨inria-00415793⟩
117 View
106 Download


Gmail Facebook Twitter LinkedIn More