Confluence of Graph Rewriting with Interfaces

Programming Languages and Systems - Lecture Notes in Computer Science ◽

10.1007/978-3-662-54434-1_6 ◽

2017 ◽

pp. 141-169 ◽

Cited By ~ 3

Author(s):

Filippo Bonchi ◽

Fabio Gadducci ◽

Aleks Kissinger ◽

Paweł Sobociński ◽

Fabio Zanasi

Keyword(s):

Graph Rewriting

Download Full-text

Completeness of an axiomatization of graph isomorphism via graph rewriting in Coq

Proceedings of the 9th ACM SIGPLAN International Conference on Certified Programs and Proofs ◽

10.1145/3372885.3373831 ◽

2020 ◽

Cited By ~ 1

Author(s):

Christian Doczkal ◽

Damien Pous

Keyword(s):

Graph Isomorphism ◽

Graph Rewriting

Download Full-text

Automatically inferring technology compatibility with an ontology and graph rewriting rules

Journal of Engineering Design ◽

10.1080/09544828.2020.1860202 ◽

2020 ◽

pp. 1-25

Author(s):

M. N. Roelofs ◽

Roelof Vos

Keyword(s):

Graph Rewriting ◽

Rewriting Rules

Download Full-text

An overlapped execution technique for graph rewriting rules

2010 International Joint Conference on Computational Cybernetics and Technical Informatics ◽

10.1109/icccyb.2010.5491279 ◽

2010 ◽

Author(s):

Tamas Meszaros ◽

Mark Asztalos ◽

Gergely Mezei

Keyword(s):

Graph Rewriting ◽

Rewriting Rules ◽

Execution Technique

Download Full-text

Inequational Deduction as Term Graph Rewriting

Electronic Notes in Theoretical Computer Science ◽

10.1016/j.entcs.2002.09.004 ◽

2007 ◽

Vol 72 (1) ◽

pp. 31-44 ◽

Cited By ~ 1

Author(s):

Andrea Corradini ◽

Fabio Gadducci ◽

Wolfram Kahl ◽

Barbara König

Keyword(s):

Graph Rewriting

Download Full-text

Using graph rewriting methods for the semi-automatic generation of parametric infrastructure models

Advanced Engineering Informatics ◽

10.1016/j.aei.2017.07.003 ◽

2017 ◽

Vol 33 ◽

pp. 502-515 ◽

Cited By ~ 6

Author(s):

Simon Vilgertshofer ◽

André Borrmann

Keyword(s):

Automatic Generation ◽

Graph Rewriting

Download Full-text

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

Volume 1B: 36th Computers and Information in Engineering Conference ◽

10.1115/detc2016-59915 ◽

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.

Download Full-text