DBScholar

Back to papers

On the Equivalence of Recursive and Nonrecursive Datalog Programs

Summary: Decision problem: determine whether a recursive Datalog program is equivalent to a given nonrecursive Datalog program. Main result: establish tight triply-exponential time upper and lower bounds for this equivalence problem. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
954
Venue
PODS
Year
1992
Pagerank
0.00012997935
Overall Rank
953 | 93.47%
DOI
10.1145/137097.137109

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{chaudhuri_pods92,
        address = {New York, NY, USA},
        series = {{PODS} '92},
        title = {{On the Equivalence of Recursive and Nonrecursive Datalog Programs}},
        url = {https://dl.acm.org/doi/10.1145/137097.137109},
        doi = {10.1145/137097.137109},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Chaudhuri, Surajit and Vardi, Moshe Y.},
        year = {1992}
}

Incoming Citations (Sorted by Pagerank)

Showing 15 of 15 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 9 of 9 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers