Database Paper Browser

Back to papers

Datalog Expressiveness of Chain Queries: Grammar Tools and Characterizations

Summary: Introduces indexed positive programmed grammars (IPPGs) in three variants to precisely capture chain-query languages definable by linear, semi-linear, and full Datalog under a natural “addressable” condition. Links these formal-language characterizations to prior FO and fixpoint descriptions. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
957
Venue
PODS
Year
1992
Pagerank
4.1945683e-05
Overall Rank
12,884 | 10.37%
DOI
-

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 4 of 4 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
3,888 On the Expressive Power of Datalog: Tools and a Case Study 1990 PODS 6.6634475e-05
6,031 On Datalog vs. Polynomial Time 1991 PODS 5.2415551e-05
Previous Page 1 / 1 Next

Semantically Similar Papers