Hard problems for simple logic programs
Summary: Undecidability for generalized single-IDB Datalog problems: sequencability and base-case linearizability, proven by CFG simulation with bounded initialization rules. Implications: containment/equivalence undecidable even for linear programs or a single recursive rule; tightens prior results. (summarized by gpt-5-nano 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,859 | Constraints and Redundancy in Datalog | 1992 | PODS | 6.6875648e-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 |
|---|---|---|---|---|
| 16 | MAGIC SETS AND OTHER STRANGE WAYS TO IMPLEMENT LOGIC PROGRAMS (Extended Abstract) | 1986 | PODS | 0.00099936325 |
| 173 | Decidability And Expressiveness Aspects Of Logic Queries | 1987 | PODS | 0.00038731283 |
| 209 | OPTIMIZING DATALOG PROGRAMS (Extended Abstract) | 1987 | PODS | 0.00034147258 |
| 359 | On the Power of Magic | 1987 | PODS | 0.00025830228 |
| 2,038 | Proof-Tree Transformation Theorems and Their Applications | 1989 | PODS | 9.7062591e-05 |
| 3,556 | Compiling Separable Recursions | 1988 | SIGMOD | 6.9712392e-05 |
| 4,324 | Commutativity And Its Role In The Processing Of Linear Recursion | 1989 | VLDB | 6.279813e-05 |
| 5,183 | Linearizing nonlinear recursions in polynomial time (Extended Abstract) | 1989 | PODS | 5.6368566e-05 |
| 7,603 | Polynomial-time program transformations in deductive databases | 1990 | PODS | 4.6959912e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 907 | On the Equivalence of Recursive and Nonrecursive Datalog Programs | 1992 | PODS | 0.00015417107 |
| 12,838 | Universal Finiteness and Satisfiability | 1994 | PODS | 4.1905499e-05 |
| 2,836 | Equivalence, Query-Reachability, and Satisfiability in Datalog Extensions | 1993 | PODS | 8.0466188e-05 |
| 1,489 | On the Decidability of Query Containment under Constraints | 1998 | PODS | 0.00011687823 |
| 1,997 | Decidability and Undecidability Results for Boundedness of Linear Recursive Queries | 1988 | PODS | 9.837483e-05 |
| 7,594 | On the First-Order Expressibility of Recursive Queries | 1989 | PODS | 4.6983854e-05 |
| 3,414 | On the Complexity of Equivalence between Recursive and Nonrecursive Datalog Programs | 1994 | PODS | 7.1172834e-05 |
| 6,234 | Inherent Complexity of Recursive Queries (Extended Abstract) | 1999 | PODS | 5.1387584e-05 |
| 4,631 | Tools for Datalog Boundedness | 1991 | PODS | 6.0289457e-05 |
| 7,603 | Polynomial-time program transformations in deductive databases | 1990 | PODS | 4.6959912e-05 |