On the Expressive Power of Datalog: Tools and a Case Study
Summary: Characterizes Datalog(!=) as a fragment of infinitary logic L^infty via pebble games, giving tools for expressiveness analysis. Applies them to classify fixed directed subgraph homeomorphism queries and proves Fortune et al.'s dichotomies proper for Datalog(!=) expressibility without complexity assumptions. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 8 of 8 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 6,031 | On Datalog vs. Polynomial Time | 1991 | PODS | 5.2415551e-05 |
| 6,748 | Can Datalog be approximated? | 1994 | PODS | 4.9401128e-05 |
| 7,822 | Weaker Forms of Monotonicity for Declarative Networking: a More Fine-grained Answer to the CALM-conjecture | 2014 | PODS | 4.6426494e-05 |
| 11,831 | Logical Aspects of Massively Parallel and Distributed Systems | 2016 | PODS | 4.1945683e-05 |
| 12,792 | Combinatorial Games in Database Theory | 1995 | PODS | 4.1945683e-05 |
| 12,826 | Bounded Arity Datalog(!=) Queries on Graphs (Extended Abstract) | 1994 | PODS | 4.1945683e-05 |
| 12,833 | Adding Disjunction to Datalog (Extended Abstract) | 1994 | PODS | 4.1945683e-05 |
| 12,884 | Datalog Expressiveness of Chain Queries: Grammar Tools and Characterizations | 1992 | PODS | 4.1945683e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 2 of 2 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 |
| 2,310 | Inductive Pebble Games And The Expressive Power Of Datalog | 1989 | PODS | 9.0580784e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,835 | The Expressiveness of a Family of Finite Set Languages | 1991 | PODS | 0.00010375854 |
| 12,826 | Bounded Arity Datalog(!=) Queries on Graphs (Extended Abstract) | 1994 | PODS | 4.1945683e-05 |
| 4,298 | Well-Founded Semantics for Extended Datalog and Ontological Reasoning | 2013 | PODS | 6.2885419e-05 |
| 9,593 | Expressiveness within Sequence Datalog | 2021 | PODS | 4.3202988e-05 |
| 12,833 | Adding Disjunction to Datalog (Extended Abstract) | 1994 | PODS | 4.1945683e-05 |
| 6,236 | Inherent Complexity of Recursive Queries (Extended Abstract) | 1999 | PODS | 5.1436959e-05 |
| 7,591 | On the First-Order Expressibility of Recursive Queries | 1989 | PODS | 4.702934e-05 |
| 7,956 | Expressiveness of Guarded Existential Rule Languages | 2014 | PODS | 4.613363e-05 |
| 12,884 | Datalog Expressiveness of Chain Queries: Grammar Tools and Characterizations | 1992 | PODS | 4.1945683e-05 |
| 2,310 | Inductive Pebble Games And The Expressive Power Of Datalog | 1989 | PODS | 9.0580784e-05 |