DBScholar

Back to papers

Decidability and Undecidability Results for Boundedness of Linear Recursive Queries

Summary: Proves boundedness (recursion elimination) undecidable for linear Datalog even with a single binary intensional predicate, tightening Gaifman et al.'s 4-ary result. Shows that for linear programs with one recursive rule and a binary intensional predicate boundedness is decidable and NP-complete. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
844
Venue
PODS
Year
1988
Pagerank
9.7653696e-05
Overall Rank
1,788 | 87.74%
DOI
10.1145/308386.308470

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{vardi_pods88,
        address = {New York, NY, USA},
        series = {{PODS} '88},
        title = {{Decidability and Undecidability Results for Boundedness of Linear Recursive Queries}},
        url = {https://dl.acm.org/doi/10.1145/308386.308470},
        doi = {10.1145/308386.308470},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Vardi, Moshe Y.},
        year = {1988}
}

Incoming Citations (Sorted by Pagerank)

Showing 17 of 17 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 8 of 8 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