Pages that link to "Item:Q753477"
From MaRDI portal
The following pages link to Recursive queries and context-free graph grammars (Q753477):
Displaying 13 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)
- Recursively indefinite databases (Q688672) (← links)
- An algorithm to convert graphs into EDNF (Q1331023) (← links)
- Path querying on acyclic graphs using Boolean grammars (Q2027852) (← links)
- Context-free path querying by Kronecker product (Q2039300) (← links)
- Structural recursion as a query language on lists and ordered trees (Q2272218) (← links)
- Regular queries on graph databases (Q2402613) (← links)
- Navigational and Rule-Based Languages for Graph Databases (Q2970302) (← links)
- Containment of Monadic Datalog Programs via Bounded Clique-Width (Q3449494) (← links)
- On using context-free graph grammars for analyzing recursive definitions (Q3830540) (← links)
- Advances in Databases and Information Systems (Q5464726) (← links)