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

On the Equivalence of Recursive and Nonr

On the Equivalence of Recursive and Nonrecursive Datalog Programs

✍ Surajit Chaudhuri; Moshe Y Vardi 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 591 KB

We study the problem of determining whether a given recursive Datalog program is equivalent to a given nonrecursive Datalog program. Since nonrecursive Datalog programs are equivalent to unions of conjunctive queries, we study also the problem of determining whether a given recursive Datalog program