A simple proof on the decidability of equivalence between recursive and nonrecursive Datalog programs

DOI10.1016/0020-0190(95)00097-VzbMath0998.68522OpenAlexW2089031578MaRDI QIDQ672662

Juan-Miguel Gracia

Publication date: 28 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(95)00097-v

zbMATH Keywords

DatabasesTheory of computation

Mathematics Subject Classification ID

Database theory (68P15)

Uses Software

• Datalog

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Recursive queries and context-free graph grammars
• Computable queries for relational data bases
• Structure and complexity of relational queries
• Relational queries computable in polynomial time
• Minimizing function-free recursive inference rules

This page was built for publication: A simple proof on the decidability of equivalence between recursive and nonrecursive Datalog programs