Inductively Sequential Term-Graph Rewrite Systems

Echahed, Rachid

doi:10.1007/978-3-540-87405-8_7

Cited by 19 publications

(19 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…These rewrite systems are extensions of those dened in [12] where graphs are labeled with formulae. Thus, the left-hand sides of the rules are labeled graphs as dened in Denition 1, whereas the right-hand sides are dened as sequences of elementary actions.…”

Section: A Model Transformation Frameworkmentioning

confidence: 99%

Ensuring Correctness of Model Transformations While Remaining Decidable

Brenas

Echahed

Strecker

2016

Theoretical Aspects of Computing – ICTAC 2016

Self Cite

View full text Add to dashboard Cite

Abstract. This paper is concerned with the interplay of the expressiveness of model and graph transformation languages, of assertion formalisms making correctness statements about transformations, and the decidability of the resulting verication problems. We put a particular focus on transformations arising in graph-based knowledge bases and model-driven engineering. We then identify requirements that should be satised by logics dedicated to reasoning about model transformations, and investigate two promising instances which are decidable fragments of rst-order logic.

show abstract

Section: A Model Transformation Frameworkmentioning

confidence: 99%

Ensuring Correctness of Model Transformations While Remaining Decidable

Brenas

Echahed

Strecker

2016

Theoretical Aspects of Computing – ICTAC 2016

Self Cite

View full text Add to dashboard Cite

show abstract

“…To describe our graph rewriting rules, we introduce a system of commands (like in [6]) which expresses step by step the modifications applied on the input graph. The transformation described above is performed in our setting as follows: Negative conditions.…”

Section: Linguistic Motivationsmentioning

confidence: 99%

Non-simplifying Graph Rewriting Termination

Bonfante

Guillaume

2013

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

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.

show abstract

“…There are two main streams in the research on graph transformations: (i) the algorithmic approaches, which describe explicitly, with a concrete algorithm, the result of applying a rule to a graph (see e.g. [15,12]), and (ii) the algebraic approaches which define abstractly a graph transformation step using basic constructs borrowed from category theory. In this paper we will consider the latter.…”

Section: Introductionmentioning

confidence: 99%

AGREE – Algebraic Graph Rewriting with Controlled Embedding

Corradini

Duval

Echahed

et al. 2015

Graph Transformation

Self Cite

View full text Add to dashboard Cite

The several algebraic approaches to graph transformation proposed in the literature all ensure that if an item is preserved by a rule, so are its connections with the context graph where it is embedded. But there are applications in which it is desirable to specify different embeddings. For example when cloning an item, there may be a need to handle the original and the copy in different ways. We propose a conservative extension of classical algebraic approaches to graph transformation, for the case of monic matches, where rules allow one to specify how the embedding of preserved items should be carried out.This work has been partly funded by projects CLIMT (ANR/(ANR-11-BS02-016), TGV (CNRS-INRIA-FAPERGS/(156779 and 12/0997-7)), VeriTeS (CNPq 485048/2012-4 and 309981/2014-0), PEPSégalité (CNRS).

show abstract

Inductively Sequential Term-Graph Rewrite Systems

Cited by 19 publications

References 13 publications

Ensuring Correctness of Model Transformations While Remaining Decidable

Ensuring Correctness of Model Transformations While Remaining Decidable

Non-simplifying Graph Rewriting Termination

AGREE – Algebraic Graph Rewriting with Controlled Embedding

Contact Info

Product

Resources

About