DBScholar

Back to papers

Modular Acyclicity and Tail Recursion in Logic Programs

Summary: Generalize acyclicity to modular acyclicity: guarantees local stratification, unique perfect/Herbrand model MP, decidable membership, and finite semi‑naive Datalog evaluation even without duplicate elimination. Augment magic‑templates to exploit tail recursion via "nonrepeating" programs and give "weak right linearity" as a sufficient syntactic condition (proper superset of right‑linear) to improve evaluation. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
927
Venue
PODS
Year
1991
Pagerank
5.6128072e-05
Overall Rank
7,454 | 48.86%
DOI
10.1145/113413.113422

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{ross_pods91,
        address = {New York, NY, USA},
        series = {{PODS} '91},
        title = {{Modular Acyclicity and Tail Recursion in Logic Programs}},
        url = {https://dl.acm.org/doi/10.1145/113413.113422},
        doi = {10.1145/113413.113422},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Ross, Kenneth A.},
        year = {1991}
}

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
3,603 Overbound and Right-Linear Queries 1991 PODS 7.2683975e-05
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