Relational Matching for Graphical Calculi of Relations

In this paper we extend an earlierapproach to graphicalrelationcalculitowards relational matching, thus allowing proofs with fewer auxiliary steps and concentrating more on the essential proof ideas. For facilitating the formal argument we introduce hierarchical relational diagrams as an intermediate structure and employ more of the algebraic graph rewriting repertoire for defining relational rewriting of these hierarchical diagrams.

• Type: Conference
• Year: 1997
• Where: RELMICS
• Authors: Wolfram Kahl
• Keywords: Fewer Auxiliary Steps, Graph Rewriting Repertoire, Hierarchical Relational Diagrams, RELMICS 1997, Theoretical Computer Science