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

DOI10.1016/0020-0190(95)00097-VMaRDI QIDQ672662zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• Computable queries for relational data bases
• scientific article; zbMATH DE number 4147465 (Why is no real title available?)
• scientific article; zbMATH DE number 3640922 (Why is no real title available?)
• scientific article; zbMATH DE number 1142327 (Why is no real title available?)
• Minimizing function-free recursive inference rules
• Recursive queries and context-free graph grammars
• Relational queries computable in polynomial time
• Structure and complexity of relational queries

Describes a project that uses

Uses Software

• Datalog

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q672662)