Relational matching for graphical calculi of relations
From MaRDI portal
DOI10.1016/S0020-0255(99)00018-3zbMATH Open0943.68092OpenAlexW2052111967MaRDI QIDQ1961869FDOQ1961869
Authors: Wolfram Kahl
Publication date: 30 January 2000
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0020-0255(99)00018-3
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Relational Methods in Computer Science
- Title not available (Why is that?)
- Term graph rewriting and garbage collection using opfibrations
- Title not available (Why is that?)
- Title not available (Why is that?)
- Graph grammars and their application to computer science. 4th international workshop, Bremen, Germany, March 5-9, 1990. Proceedings
- Relation algebraic domain constructions
- Relational treatment of term graphs with bound variables
Cited In (7)
- A graphical representation of relational formulae with complementation
- An \textsc{Agg} application supporting visual reasoning
- Calculational proofs in relational graphical linear algebra
- Positive Fork Graph Calculus
- Normal forms for binary relations
- Simulation relations for pattern matching in directed graphs
- On a Graph Calculus for Algebras of Relations
Uses Software
This page was built for publication: Relational matching for graphical calculi of relations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1961869)