Abstract
A concept of graph unification and matching is introduced by using hyperedges as graph variables and hyperedge replacement as substitution mechanism. It is shown that a restricted form of graph unification corresponds to solving linear Diophantine equations, and hence is decidable. For graph matching, transformation rules are given which compute all (pure) solutions to a matching problem. The matching concept suggests a new graph rewriting approach which is very simple to describe and which generalizes the well-known double-pnshout approach.
Cite
CITATION STYLE
Plump, D., & Habel, A. (1996). Graph Unification and Matching. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1073, pp. 76–88). Springer Verlag. https://doi.org/10.1007/3-540-61228-9_80
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
