Database Paper Browser

Back to papers

Function Symbols in Tuple-Generating Dependencies: Expressive Power and Computability

Summary: Analyzes how explicit function symbols extend tgds via second-order, nested, and newly introduced Henkin tgds to capture expressiveness beyond Skolemized existentials. Characterizes intertranslatability, decidability of query answering under tgd syntactic criteria, and model-checking complexity. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1641
Venue
PODS
Year
2015
Pagerank
4.4432234e-05
Overall Rank
8,815 | 38.68%
DOI
10.1145/2745754.2745756

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
5,705 Datalog Unchained 2021 PODS 5.3621239e-05
11,674 Rewriting of Plain SO Tgds into Nested Tgds 2019 VLDB 4.1945683e-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.

Previous Page 1 / 1 Next

Semantically Similar Papers