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)
Incoming Non-self Citations Over Time
Authors
- 1. Tomasz Gogacz (University of Wrocław)
- 2. Jerzy Marcinkowski (University of Wrocław)
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.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 134 | Testing Containment of Conjunctive Queries Under Functional and Inclusion Dependencies (Extended Abstract) | 1982 | PODS | 0.00030343737 |
| 2,481 | A General Datalog-Based Framework for Tractable Query Answering over Ontologies | 2009 | PODS | 8.5196153e-05 |
| 2,544 | Advanced Processing for Ontological Queries | 2010 | VLDB | 8.4444438e-05 |
| 3,433 | On the Decidability and Finite Controllability of Query Processing in Databases with Incomplete Information | 2006 | PODS | 7.4181806e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 3,355 | A Framework for Testing Safety and Effective Computability of Extended Datalog (Extended Abstract) | 1988 | SIGMOD |
| 2 | 11,639 | Deciding Boundedness of Monadic Sirups | 2021 | PODS |
| 3 | 1,630 | On the Decidability of Query Containment under Constraints | 1998 | PODS |
| 4 | 10,148 | Size Bound-Adorned Datalog | 2026 | PODS |
| 5 | 8,817 | Function Symbols in Tuple-Generating Dependencies: Expressive Power and Computability | 2015 | PODS |
| 6 | 11,527 | A Journey to the Frontiers of Query Rewritability | 2022 | PODS |
| 7 | 3,476 | Data Functions, Datalog and Negation (Extended Abstract) | 1988 | SIGMOD |
| 8 | 7,972 | On the First-Order Expressibility of Recursive Queries | 1989 | PODS |
| 9 | 4,615 | Tools for Datalog Boundedness | 1991 | PODS |
| 10 | 10,644 | No Cliques Allowed: The Next Step Towards BDD/FC Conjecture | 2025 | PODS |