DBScholar

Back to papers

On the BDD/FC Conjecture

Summary: Conjectures that Bounded Derivation Depth (BDD) implies Finite Controllability (FC) for Datalog∃ programs. Provides supporting evidence and proves the implication for all theories over binary signatures. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1590
Venue
PODS
Year
2013
Pagerank
5.4574671e-05
Overall Rank
8,275 | 43.23%
DOI
10.1145/2463664.2463668

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{gogacz_pods13,
        address = {New York, NY, USA},
        series = {{PODS} '13},
        title = {{On the BDD/FC Conjecture}},
        url = {https://dl.acm.org/doi/10.1145/2463664.2463668},
        doi = {10.1145/2463664.2463668},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Gogacz, Tomasz and Marcinkowski, Jerzy},
        year = {2013}
}

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
10,644 No Cliques Allowed: The Next Step Towards BDD/FC Conjecture 2025 PODS 5.093636e-05
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.

Previous Page 1 / 1 Next

Semantically Similar Papers