Skip to Main content Skip to Navigation
Conference papers

Non-simplifying Graph Rewriting Termination

Guillaume Bonfante 1 Bruno Guillaume 2
1 CARTE - Theoretical adverse computations, and safety
LORIA - FM - Department of Formal Methods , Inria Nancy - Grand Est
2 SEMAGRAMME - Semantic Analysis of Natural Language
Inria Nancy - Grand Est, LORIA - NLPKD - Department of Natural Language Processing & Knowledge Discovery
Abstract : So far, a very large amount of work in Natural Language Processing (NLP) rely on trees as the core mathematical structure to represent linguistic informations (e.g. in Chomsky's work). However, some linguistic phenomena do not cope properly with trees. In a former paper, we showed the benefit of encoding linguistic structures by graphs and of using graph rewriting rules to compute on those structures. Justified by some linguistic considerations, graph rewriting is characterized by two features: first, there is no node creation along computations and second, there are non-local edge modifications. Under these hypotheses, we show that uniform termination is undecidable and that non-uniform termination is decidable. We describe two termination techniques based on weights and we give complexity bound on the derivation length for these rewriting systems.
Document type :
Conference papers
Complete list of metadata

Cited literature [15 references]  Display  Hide  Download
Contributor : Bruno Guillaume Connect in order to contact the contributor
Submitted on : Thursday, December 19, 2013 - 3:48:58 PM
Last modification on : Saturday, October 16, 2021 - 11:26:06 AM
Long-term archiving on: : Thursday, March 20, 2014 - 12:00:22 PM


Files produced by the author(s)


  • HAL Id : hal-00921053, version 1


Guillaume Bonfante, Bruno Guillaume. Non-simplifying Graph Rewriting Termination. TERMGRAPH, Mar 2013, Rome, Italy. pp.4-16. ⟨hal-00921053⟩



Les métriques sont temporairement indisponibles