Home
Scholarly Works
Relational matching for graphical calculi of...
Conference

Relational matching for graphical calculi of relations

Abstract

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.

Authors

Kahl W

Volume

119

Pagination

pp. 253-273

Publisher

Elsevier

Publication Date

October 2, 1999

DOI

10.1016/s0020-0255(99)00018-3

Conference proceedings

Information Sciences

Issue

3-4

ISSN

0020-0255

Contact the Experts team