DBScholar

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
1640
Venue
PODS
Year
2015
Pagerank
5.3637297e-05
Overall Rank
8,817 | 39.51%
DOI
10.1145/2745754.2745756

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{gottlob_pods15,
        address = {New York, NY, USA},
        series = {{PODS} '15},
        title = {{Function Symbols in Tuple-Generating Dependencies: Expressive Power and Computability}},
        url = {https://dl.acm.org/doi/10.1145/2745754.2745756},
        doi = {10.1145/2745754.2745756},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Gottlob, Georg and Pichler, Reinhard and Sallinger, Emanuel},
        year = {2015}
}

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
4,943 Datalog Unchained 2021 PODS 6.4332239e-05
11,869 Rewriting of Plain SO Tgds into Nested Tgds 2019 VLDB 5.093636e-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