119 (1999), Nos. 3-4, pp. A href="http://www.elsevier.com/gej-ng//10/23/143/47/27/33/abstract.html">253-273.
In this paper we extend an earlier approach to graphical relation calculi towards 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.
This work is in continuation of [Kahl-1996a].