May 14, 2024 · When repairing inconsistencies in a graph, we use graph transformation rules with so-called impairment- and repair-indicating application ...
Jul 2, 2024 · We introduce a new dynamic analysis approach that ranks matches of rules and related rule applications according to their effects on improving graph ...
May 14, 2024 · This theory forms the basis for algorithms with look-ahead that rank graph transformations according to their potential for graph repair. An ...
Using Application Conditions to Rank Graph Transformations for ...
tubiblio.ulb.tu-darmstadt.de › ...
When repairing inconsistencies in a graph, we use graph transformation rules with so-called impairment- and repair-indicating application conditions to ...
Using Application Conditions to Rank Graph Transformations for Graph Repair. https://doi.org/10.1007/978-3-031-64285-2_8 ·. Journal: Graph Transformation ...
Using Application Conditions to Rank Graph Transformations for Graph Repair. Lars Fritsche, Alexander Lauer, Andy Schürr, Gabriele Taentzer. Pages 138-157.
To describe consistency properties on graphs, graph conditions have been introduced. They are expressively equivalent to first-order constraints on graphs.
Using application conditions to rank graph transformations for graph repair. L Fritsche, A Lauer, A Schürr, G Taentzer. International Conference on Graph ...
Given a graph grammar and a graph constraint, a graph grammar is constructed that generates some/all graphs of the given grammar that satisfy the constraint.
In this paper we provide a non-technical introduction to the basic concepts of typed graph transformation systems, completed by a survey of more advanced ...