From Semantic Graphs to Logic Formulae

Guy Perrier; Mathieu Morey; Maxime Amblard

inria-00415793, version 1

From Semantic Graphs to Logic Formulae

Guy Perrier () ¹, Mathieu Morey ()^a^, 1, Maxime Amblard ()^a^, 1

(2009)

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.

a – Université Nancy II
1: CALLIGRAMME (INRIA Lorraine - LORIA)
INRIA – CNRS : UMR7503 – Université Henri Poincaré - Nancy I – Université Nancy II – Institut National Polytechnique de Lorraine (INPL)

inria-00415793, version 1
http://hal.inria.fr/inria-00415793
oai:hal.inria.fr:inria-00415793
From: Guy Perrier <>
Submitted on: Friday, 11 September 2009 08:28:48
Updated on: Friday, 11 September 2009 09:34:23

See detailed view

Associated documents

PDF :

Export

Bibtex EndNote TEI RefWorks

<?xml version="1.0" encoding="UTF-8"?>
<listBibl xmlns="http://www.tei-c.org/ns/1.0" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML">
<listBibl type="report"><head>Research reports</head>
<biblStruct type="report" xml:id="inria-00415793"><monogr>
<author><persName><forename>Guy</forename><surname>Perrier</surname></persName>
<affiliation>
<orgName type="laboratory">INRIA Lorraine - LORIA</orgName>
<orgName type="team">CALLIGRAMME</orgName>
<country>FR</country>
<orgName type="institution">INRIA</orgName>
<orgName type="institution">CNRS : UMR7503</orgName>
<orgName type="institution">Université Henri Poincaré - Nancy I</orgName>
<orgName type="institution">Université Nancy II</orgName>
<orgName type="institution">Institut National Polytechnique de Lorraine (INPL)</orgName>
</affiliation>
</author>
<author><persName><forename>Mathieu</forename><surname>Morey</surname></persName>
<affiliation>
<orgName type="laboratory">INRIA Lorraine - LORIA</orgName>
<orgName type="team">CALLIGRAMME</orgName>
<country>FR</country>
<orgName type="institution">INRIA</orgName>
<orgName type="institution">CNRS : UMR7503</orgName>
<orgName type="institution">Université Henri Poincaré - Nancy I</orgName>
<orgName type="institution">Université Nancy II</orgName>
<orgName type="institution">Institut National Polytechnique de Lorraine (INPL)</orgName>
</affiliation>
</author>
<author><persName><forename>Maxime</forename><surname>Amblard</surname></persName>
<affiliation>
<orgName type="laboratory">INRIA Lorraine - LORIA</orgName>
<orgName type="team">CALLIGRAMME</orgName>
<country>FR</country>
<orgName type="institution">INRIA</orgName>
<orgName type="institution">CNRS : UMR7503</orgName>
<orgName type="institution">Université Henri Poincaré - Nancy I</orgName>
<orgName type="institution">Université Nancy II</orgName>
<orgName type="institution">Institut National Polytechnique de Lorraine (INPL)</orgName>
</affiliation>
</author>
<title type="main" level="m">From Semantic Graphs to Logic Formulae</title><title type="main" level="m">From Semantic Graphs to Logic Formulae</title><imprint><biblScope type="publicationDate">2009-00-00</biblScope><biblScope type="pp">9</biblScope></imprint></monogr><idno type="HALid">http://hal.inria.fr/inria-00415793</idno><idno type="HALFile">http://hal.inria.fr/inria-00415793/PDF/PerrierMoreyAmblardEACL09.pdf</idno></biblStruct>
</listBibl>
</listBibl>