We study the problem of determining whether a given recursive Datalog program is equivalent to a given nonrecursive Datalog program. We prove triply exponential upper and lower time bounds.
No takes yet. Share an insight, caveat, or question.
Chaudhuri et al. (1992) studied this question.