The following pages link to (Q4037311):
Displaying 21 items.
- Graph theoretical structures in logic programs and default theories (Q672050) (← links)
- Symbol -- relation grammars: A formalism for graphical languages (Q675054) (← links)
- Graph rewriting for a partial ordering semantics of concurrent constraints programming (Q685459) (← links)
- Hyperedge replacement jungle rewriting for term-rewriting systems and logic programming (Q685465) (← links)
- The power of programmed grammars with graphs from various classes (Q854407) (← links)
- Computation graphs for actor grammars (Q1208925) (← links)
- Logical description of context-free graph languages (Q1384534) (← links)
- Interactive graph grammar (Q1430215) (← links)
- A calculus of concurrent graph-rewriting processes (Q2291821) (← links)
- (Q2736348) (← links)
- (Q3204030) (← links)
- Ugo Montanari and Graph Transformation (Q3507353) (← links)
- On the Expressive Power of Graph Logic (Q3613359) (← links)
- Logic Programming with Graph Automorphism: Integrating<tt>nauty</tt>with Prolog (Tool Description) (Q4593050) (← links)
- (Q4890712) (← links)
- (Q4939197) (← links)
- Graph Grammar Extraction from Source Code (Q5045459) (← links)
- Graph grammars, a new paradigm for implementing visual languages (Q5055718) (← links)
- Jungle rewriting: An abstract description of a lazy narrowing machine (Q5096278) (← links)
- Parallelism in single-pushout graph rewriting (Q5096286) (← links)
- Contextual occurrence nets and concurrent constraint programming (Q5096288) (← links)
