Recursive queries and context-free graph grammars

DOI10.1016/0304-3975(51)90009-6zbMath0716.68026OpenAlexW2043199435MaRDI QIDQ753477

No author found.

Publication date: 1991

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(51)90009-6

zbMATH Keywords

recursive queriesrelational databasecomputation graphs of the querycontext-free graph grammar

Mathematics Subject Classification ID

Database theory (68P15) Semantics in the theory of computing (68Q55) Grammars and rewriting systems (68Q42)

Related Items (6)

Containment of Monadic Datalog Programs via Bounded Clique-Width ⋮ Regular queries on graph databases ⋮ Navigational and Rule-Based Languages for Graph Databases ⋮ A simple proof on the decidability of equivalence between recursive and nonrecursive Datalog programs ⋮ On the equivalence of recursive and nonrecursive Datalog programs ⋮ Hyperedge replacement jungle rewriting for term-rewriting systems and logic programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Equivalences and transformations of regular systems - applications to recursive program schemes and grammars
• An axiomatic definition of context-free rewriting and its application to NLC graph grammars
• Fixed point theorems and semantics: A folk tale
• Recursive query processing: The power of logic
• Translation of logic programs into functional fixpoint equations
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• Graph expressions and graph rewritings
• The Semantics of Predicate Logic as a Programming Language
• Algebraic automata and context-free sets

This page was built for publication: Recursive queries and context-free graph grammars