Expressibility of Bounded-Arity Fixed-Point Query Hierarchies
Summary: Proves strict bounded-arity hierarchies for FO with fixed-point operators: allowing predicate-variables of arity k+1 strictly increases the set of definable k-ary queries versus arity k. Also separates operators at each arity: k-ary IFP > LFP and k-ary GFP > IFP. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 0 of 0 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,741 | Relational Expressive Power of Constraint Query Languages | 1996 | PODS | 0.00010714223 |
| 4,881 | Translation And Optimization Of Logic Queries: The Algebraic Approach | 1986 | VLDB | 5.8567721e-05 |
| 3,040 | Tractable Query Languages for Complex Object Databases | 1991 | PODS | 7.6707607e-05 |
| 172 | Decidability And Expressiveness Aspects Of Logic Queries | 1987 | PODS | 0.00038808816 |
| 431 | On the Complexity of Database Queries (Extended Abstract) | 1997 | PODS | 0.00023370207 |
| 581 | The Complexity of Querying Indefinite Data about Linearly Ordered Domains (Preliminary Version) | 1992 | PODS | 0.00019767772 |
| 7,591 | On the First-Order Expressibility of Recursive Queries | 1989 | PODS | 4.702934e-05 |
| 11,644 | Compiling Existential-Positive Queries to Bounded-Variable Fragments | 2019 | PODS | 4.1945683e-05 |
| 12,826 | Bounded Arity Datalog(!=) Queries on Graphs (Extended Abstract) | 1994 | PODS | 4.1945683e-05 |
| 12,433 | Non-Linear Prefixes in Query Languages | 2007 | PODS | 4.1945683e-05 |