The following pages link to (Q2736348):
Displaying 9 items.
- 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)
- Context-free hypergraph grammars have the same term-generating power as attribute grammars (Q1199703) (← links)
- Mapping Fusion and Synchronized Hyperedge Replacement into logic programming (Q3430667) (← links)
- Relativized hyperequivalence of logic programs for modular programming (Q3648358) (← links)
- Logic Programming with Graph Automorphism: Integrating<tt>nauty</tt>with Prolog (Tool Description) (Q4593050) (← links)
- Decidability of Safety in Graph-Based Models for Access Control (Q5030182) (← links)
- Logic based structure rewriting systems (Q5096292) (← links)
- Towards the Use of Hypergraphs in Multi-adjoint Logic Programming (Q5215753) (← links)
