Pages that link to "Item:Q753477"
From MaRDI portal
The following pages link to Recursive queries and context-free graph grammars (Q753477):
Displayed 3 items.
- A simple proof on the decidability of equivalence between recursive and nonrecursive Datalog programs (Q672662) (← links)
- On the equivalence of recursive and nonrecursive Datalog programs (Q676421) (← links)
- Hyperedge replacement jungle rewriting for term-rewriting systems and logic programming (Q685465) (← links)