scientific article; zbMATH DE number 4049096
[For the entire collection see Zbl 0636.00013.] The standard algebraic theory of graph grammars is based on the notion of ``color-preserving graph morphisms and on a ``double pushout construction to represent gluing of graphs. In this paper, we impose a simple structure on the sets of colors to allow variables in both graphs and productions. Instantiations are performed by graph morphisms. Using relative unification, we define the composition of rules and prove the concurrency theorem in this more general framework. By restricting our attention to rooted directed acyclic graphs, we can represent standard term rewriting with first order substitutions. One of the motivations for this study is the attempt to provide a description of the static behavior of rule-based expert systems.
- Term graph rewriting and garbage collection using opfibrations
- Parallel high-level replacement systems
- Graph rewriting and relabeling with PBPO\textsuperscript{+}
- Restricted combinatory unification
- Drags: a compositional algebraic framework for graph rewriting
- Graph-based specification of access control policies
- Unification of drags and confluence of drag rewriting
- Rational unification in 28 characters
- Graph Transformation by Computational Category Theory
- Graph grammars and logic programming
- Graph unification and matching
- Marker-directed optimization of UnCAL graph transformations
- Extending graph rewriting with copying
- A formal model for role-based access control using graph transformation
- Graph rewriting and relabeling with PBPO^+: a unifying theory for quasitoposes
- Multilevel graph grammars
- On categorical graph grammars integrating structural transformations and operations on labels
- Hyperedge replacement jungle rewriting for term-rewriting systems and logic programming
- Categorical principles, techniques and results for high-level-replacement systems in computer science
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3785985)