From Semantic Graphs to Logic Formulae

Guy Perrier 1 Mathieu Morey 1 Maxime Amblard 1
1 CALLIGRAMME - Linear logic, proof networks and categorial grammars
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : 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.
Document type :
Complete list of metadatas

Cited literature [8 references]  Display  Hide  Download
Contributor : Guy Perrier <>
Submitted on : Friday, September 11, 2009 - 8:28:48 AM
Last modification on : Thursday, January 11, 2018 - 6:19:48 AM
Long-term archiving on : Tuesday, October 16, 2012 - 10:50:09 AM


Files produced by the author(s)


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



Record views


Files downloads