Tools for Datalog Boundedness
Summary: Develops tools to prove (un)decidability of Datalog boundedness under small-arity or few-rule regimes, pinpointing tight undecidability thresholds. Techniques: mortality reductions for arity-3 (and arity-1 with ≠); a polymorphic single-rule encoding for minimal-rule undecidability; semi-linear-set analysis to decide one-linear-rule plus initializations. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 6 of 6 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 909 | On the Equivalence of Recursive and Nonrecursive Datalog Programs | 1992 | PODS | 0.00015428222 |
| 3,413 | On the Complexity of Equivalence between Recursive and Nonrecursive Datalog Programs | 1994 | PODS | 7.1240395e-05 |
| 7,884 | Finding Nonrecursive Envelopes for Datalog Predicates | 1993 | PODS | 4.6277758e-05 |
| 10,344 | Circuits and Formulas for Datalog over Semirings | 2025 | PODS | 4.1945683e-05 |
| 11,441 | Deciding Boundedness of Monadic Sirups | 2021 | PODS | 4.1945683e-05 |
| 12,829 | Universal Finiteness and Satisfiability | 1994 | PODS | 4.1945683e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 6 of 6 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 |
| 200 | OPTIMIZING DATALOG PROGRAMS (Extended Abstract) | 1987 | PODS | 0.00035012858 |
| 537 | Parallel Evaluation of Recursive Rule Queries | 1986 | PODS | 0.0002068591 |
| 617 | A Time Bound on the Materialization of Some Recursively Defined Views | 1985 | VLDB | 0.00019090876 |
| 1,991 | Decidability and Undecidability Results for Boundedness of Linear Recursive Queries | 1988 | PODS | 9.84713e-05 |
| 2,206 | A Decidable Class of Bounded Recursions | 1987 | PODS | 9.2910236e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5,992 | Evaluating Datalog over Semirings: A Grounding-based Approach | 2024 | PODS | 5.2415551e-05 |
| 6,236 | Inherent Complexity of Recursive Queries (Extended Abstract) | 1999 | PODS | 5.1436959e-05 |
| 12,826 | Bounded Arity Datalog(!=) Queries on Graphs (Extended Abstract) | 1994 | PODS | 4.1945683e-05 |
| 7,774 | Decidability and Undecidability Results for the Termination Problem of Active Database Rules | 1998 | PODS | 4.6543275e-05 |
| 4,136 | Safety of Datalog Queries over Infinite Databases | 1989 | PODS | 6.4188795e-05 |
| 1,490 | On the Decidability of Query Containment under Constraints | 1998 | PODS | 0.00011699154 |
| 12,829 | Universal Finiteness and Satisfiability | 1994 | PODS | 4.1945683e-05 |
| 7,018 | Hard problems for simple logic programs | 1990 | SIGMOD | 4.8602644e-05 |
| 1,991 | Decidability and Undecidability Results for Boundedness of Linear Recursive Queries | 1988 | PODS | 9.84713e-05 |
| 7,591 | On the First-Order Expressibility of Recursive Queries | 1989 | PODS | 4.702934e-05 |