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)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3,414 | Overbound and Right-Linear Queries | 1991 | PODS | 7.1232056e-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.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 172 | Decidability And Expressiveness Aspects Of Logic Queries | 1987 | PODS | 0.00038808816 |
| 445 | The Magic of Duplicates and Aggregates | 1990 | VLDB | 0.0002294367 |
| 1,122 | Bottom-Up Beats Top-Down For Datalog | 1989 | PODS | 0.0001385042 |
| 1,381 | Modular Stratification and Magic Sets for DATALOG Programs with Negation | 1990 | PODS | 0.00012283951 |
| 2,042 | Efficient Evaluation of Right-, Left-, and Multi-Linear Rules | 1989 | SIGMOD | 9.699257e-05 |
| 2,339 | Inference of Monotonicity Constraints in Datalog Programs (Extended Abstract) | 1989 | PODS | 9.005745e-05 |
| 3,414 | Overbound and Right-Linear Queries | 1991 | PODS | 7.1232056e-05 |
| 3,585 | Right-, left- and multi-linear rule transformations that maintain context information | 1990 | VLDB | 6.9454028e-05 |
| 4,178 | Argument Reduction by Factoring | 1989 | VLDB | 6.3812002e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3,435 | Inference of Inequality Constraints in Logic Programs (Extended Abstract) | 1991 | PODS | 7.0966834e-05 |
| 7,018 | Hard problems for simple logic programs | 1990 | SIGMOD | 4.8602644e-05 |
| 909 | On the Equivalence of Recursive and Nonrecursive Datalog Programs | 1992 | PODS | 0.00015428222 |
| 6,365 | On the Expected Size of Recursive Datalog Queries | 1991 | PODS | 5.0945408e-05 |
| 7,591 | On the First-Order Expressibility of Recursive Queries | 1989 | PODS | 4.702934e-05 |
| 4,178 | Argument Reduction by Factoring | 1989 | VLDB | 6.3812002e-05 |
| 12,829 | Universal Finiteness and Satisfiability | 1994 | PODS | 4.1945683e-05 |
| 5,628 | Efficient Implementation of Loops in Bottom-Up Evaluation of Logic Queries | 1990 | VLDB | 5.4030815e-05 |
| 7,266 | Termination Detection in Logic Programs using Argument Sizes* (Extended Abstract) | 1991 | PODS | 4.782728e-05 |
| 1,381 | Modular Stratification and Magic Sets for DATALOG Programs with Negation | 1990 | PODS | 0.00012283951 |