On the power of Rule-Based Languages with Sets
Summary: k-level COL/finite LDL/ELPS/IQL languages are data-complexity complete for the k‑th level of hyper‑exponential time and, with domain order, capture all relational generic queries at that level (without order they capture level k−1). Highlights that grouping rules and domain order strictly boost expressivity—grouping can encode certain non‑monotonic queries, positive ELPS gains power with an order, and finite ELPS needs negation for full expressibility. (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 |
|---|---|---|---|---|
| 4,315 | Towards a Unified Visual Database Access | 1993 | SIGMOD | 6.2885419e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 7 of 7 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 352 | Object Identity As A Query Language Primitive | 1989 | SIGMOD | 0.00026299604 |
| 440 | A Calculus for Complex Objects | 1986 | PODS | 0.00023084404 |
| 485 | A New Approach to Database Logic | 1984 | PODS | 0.00022085103 |
| 1,018 | ILOG: Declarative Creation and Manipulation of Object Identifiers | 1990 | VLDB | 0.00014627963 |
| 1,448 | Theory of Database Queries (Extended Abstract) | 1988 | PODS | 0.00011938045 |
| 2,800 | On the Expressive Power of Database Queries with Intermediate Types | 1988 | PODS | 8.1019352e-05 |
| 3,392 | The Powerset Algebra As A Result Of Adding Programming Constructs To The Nested Relational Algebra | 1988 | SIGMOD | 7.1485699e-05 |
Previous
Page 1 / 1
Next