scholarly journals Rule-based transformation of graph rewriting rules: Towards higher-order graph grammars

2015 ◽  
Vol 594 ◽  
pp. 1-23 ◽  
Author(s):  
Rodrigo Machado ◽  
Leila Ribeiro ◽  
Reiko Heckel
Keyword(s):  
Higher Order ◽  
Graph Grammars ◽  
Rule Based ◽  
Graph Rewriting ◽  
Rewriting Rules

Schema Compliant Consistency Management via Triple Graph Grammars and Integer Linear Programming

2021 ◽  
Author(s):  
Nils Weidmann ◽  
Anthony Anjorin
Keyword(s):  
Linear Programming ◽  
Integer Linear Programming ◽  
Experimental Evaluation ◽  
Graph Grammars ◽  
Model Driven Engineering ◽  
Rule Based ◽  
Consistency Management ◽  
Model Driven ◽  
Triple Graph Grammars ◽  
Domain Constraints

AbstractIn the field of Model-Driven Engineering, Triple Graph Grammars (TGGs) play an important role as a rule-based means of implementing consistency management. From a declarative specification of a consistency relation, several operations including forward and backward transformations, (concurrent) synchronisation, and consistency checks can be automatically derived. For TGGs to be applicable in realistic application scenarios, expressiveness in terms of supported language features is very important. A TGG tool is schema compliant if it can take domain constraints, such as multiplicity constraints in a meta-model, into account when performing consistency management tasks. To guarantee schema compliance, most TGG tools allow application conditions to be attached as necessary to relevant rules. This strategy is problematic for at least two reasons: First, ensuring compliance to a sufficiently expressive schema for all previously mentioned derived operations is still an open challenge; to the best of our knowledge, all existing TGG tools only support a very restricted subset of application conditions. Second, it is conceptually demanding for the user to indirectly specify domain constraints as application conditions, especially because this has to be completely revisited every time the TGG or domain constraint is changed. While domain constraints can in theory be automatically transformed to obtain the required set of application conditions, this has only been successfully transferred to TGGs for a very limited subset of domain constraints. To address these limitations, this paper proposes a search-based strategy for achieving schema compliance. We show that all correctness and completeness properties, previously proven in a setting without domain constraints, still hold when schema compliance is to be additionally guaranteed. An implementation and experimental evaluation are provided to support our claim of practical applicability.

Two Approaches to the Induction of Graph-Rewriting Rules for Function-Based Design Synthesis

2016 ◽  
Author(s):  
Julian R. Eichhoff ◽  
Felix Baumann ◽  
Dieter Roller
Keyword(s):  
Engineering Design ◽  
Conceptual Design ◽  
Automatic Generation ◽  
Production Rules ◽  
Design Synthesis ◽  
Graph Rewriting ◽  
Conceptual Engineering ◽  
Frequent Subgraph ◽  
Rule Set ◽  
Rewriting Rules

In this paper we demonstrate and compare two complementary approaches to the automatic generation of production rules from a set of given graphs representing sample designs. The first approach generates a complete rule set from scratch by means of frequent subgraph discovery. Whereas the second approach is intended to learn additional rules that fit an existing, yet incomplete, rule set using genetic programming. Both approaches have been developed and tested in the context of an application for automated conceptual engineering design, more specifically functional decomposition. They can be considered feasible, complementary approaches to the automatic inference of graph rewriting rules for conceptual design applications.

Graph rewriting rules for RDF database evolution: optimizing side-effect processing

2021 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Jacques Chabin ◽  
Cédric Eichler ◽  
Mirian Halfeld Ferrari ◽  
Nicolas Hiot
Keyword(s):  
Side Effects ◽  
Side Effect ◽  
Choice Functions ◽  
Graph Rewriting ◽  
Content Type ◽  
Closed World ◽  
Rdf Database ◽  
Description Framework ◽  
Resource Description ◽  
Rewriting Rules

Purpose Graph rewriting concerns the technique of transforming a graph; it is thus natural to conceive its application in the evolution of graph databases. This paper aims to propose a two-step framework where rewriting rules formalize instance or schema changes, ensuring graph’s consistency with respect to constraints, and updates are managed by ensuring rule applicability through the generation of side effects: new updates which guarantee that rule application conditions hold. Design/methodology/approach This paper proposes Schema Evolution Through UPdates, optimized version (SetUpOPT), a theoretical and applied framework for the management of resource description framework (RDF)/S database evolution on the basis of graph rewriting rules. The framework is an improvement of SetUp which avoids the computation of superfluous side effects and proposes, via SetUpoptND, a flexible and extensible package of solutions to deal with non-determinism. Findings This paper shows graph rewriting into a practical and useful application which ensures consistent evolution of RDF databases. It introduces an optimised approach for dealing with side effects and a flexible and customizable way of dealing with non-determinism. Experimental evaluation of SetUpoptND demonstrates the importance of the proposed optimisations as they significantly reduce side-effect generation and limit data degradation. Originality/value SetUp originality lies in the use of graph rewriting techniques under the closed world assumption to set an updating system which preserves database consistency. Efficiency is ensured by avoiding the generation of superfluous side effects. Flexibility is guaranteed by offering different solutions for non-determinism and allowing the integration of customized choice functions.

Sign in / Sign up

Export Citation Format

Share Document