On the First-Order Expressibility of Recursive Queries
Summary: Establishes that for several syntactic fragments of Datalog, first-order (FO) expressibility over finite structures coincides with boundedness (equivalence to recursion-free Datalog). Consequences: FO-expressibility undecidable for binary programs, decidable for monadic ones, and Σ^0_2-complete in general (e.g., transitive closure/path is non-FO). (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 | On the Complexity of Equivalence between Recursive and Nonrecursive Datalog Programs | 1994 | PODS | 7.1172834e-05 |
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.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 79 | An Amateur's Introduction to Recursive Query Processing Strategies | 1986 | SIGMOD | 0.00056010993 |
| 541 | Parallel Evaluation of Recursive Rule Queries | 1986 | PODS | 0.00020586706 |
| 612 | A Time Bound on the Materialization of Some Recursively Defined Views | 1985 | VLDB | 0.0001915957 |
| 1,167 | On Computing Restricted Projections of Representative Instances | 1985 | PODS | 0.0001354084 |
| 1,200 | Data Independent Recursion in Deductive Databases | 1986 | PODS | 0.00013342243 |
| 1,636 | Bounds on the Propagation of Selection into Logic Programs | 1987 | PODS | 0.00011058643 |
| 1,997 | Decidability and Undecidability Results for Boundedness of Linear Recursive Queries | 1988 | PODS | 9.837483e-05 |
| 2,212 | A Decidable Class of Bounded Recursions | 1987 | PODS | 9.2818302e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,912 | Convergence of Datalog over (Pre-) Semirings | 2022 | PODS | 7.9261665e-05 |
| 12,838 | Universal Finiteness and Satisfiability | 1994 | PODS | 4.1905499e-05 |
| 7,066 | On the Decidability of Containment of Recursive Datalog Queries - Preliminary report | 2004 | PODS | 4.8389293e-05 |
| 9,285 | A Theory of Regular Queries | 2016 | PODS | 4.3594818e-05 |
| 4,138 | Safety of Datalog Queries over Infinite Databases | 1989 | PODS | 6.4127061e-05 |
| 5,996 | Evaluating Datalog over Semirings: A Grounding-based Approach | 2024 | PODS | 5.2365238e-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 |
| 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 |