No Cliques Allowed: The Next Step Towards BDD/FC Conjecture
Summary: No Cliques Allowed probes finite controllability for bounded derivation depth (bdd) rule sets; universal models from bdd rules cannot host arbitrarily large tournaments without entailing the loop query exists x E(x,x). This narrows the space of counterexamples to the bdd => fc conjecture. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Lucas Larroque (INRIA; National Centre for Scientific Research; PSL University; École Normale Supérieure)
- 2. Piotr Ostropolski-Nalewaja (Technical University of Dresden; University of Wrocław)
- 3. Michaël Thomazo (INRIA; National Centre for Scientific Research; PSL University; École Normale Supérieure)
BibTeX Citation
@inproceedings{larroque_pods25,
address = {New York, NY, USA},
series = {{PODS} '25},
title = {{No Cliques Allowed: The Next Step Towards BDD/FC Conjecture}},
url = {https://dl.acm.org/doi/10.1145/3725238},
doi = {10.1145/3725238},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Larroque, Lucas and Ostropolski-Nalewaja, Piotr and Thomazo, Michaël},
year = {2025}
}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 6 of 6 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 40 | Testing Implications Of Data Dependencies | 1979 | SIGMOD | 0.00046918506 |
| 134 | Testing Containment of Conjunctive Queries Under Functional and Inclusion Dependencies (Extended Abstract) | 1982 | PODS | 0.00030343737 |
| 525 | The Chase Revisited | 2008 | PODS | 0.00017118255 |
| 2,544 | Advanced Processing for Ontological Queries | 2010 | VLDB | 8.4444438e-05 |
| 8,275 | On the BDD/FC Conjecture | 2013 | PODS | 5.4574671e-05 |
| 11,527 | A Journey to the Frontiers of Query Rewritability | 2022 | PODS | 5.093636e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 11,363 | Extremal Fitting Problems for Conjunctive Queries | 2023 | PODS |
| 2 | 3,355 | A Framework for Testing Safety and Effective Computability of Extended Datalog (Extended Abstract) | 1988 | SIGMOD |
| 3 | 4,615 | Tools for Datalog Boundedness | 1991 | PODS |
| 4 | 7,904 | Tight Bounds of Circuits for Sum-Product Queries | 2024 | PODS |
| 5 | 12,097 | Default Negation for Non-Guarded Existential Rules | 2015 | PODS |
| 6 | 11,893 | Containment for Rule-Based Ontology-Mediated Queries | 2018 | PODS |
| 7 | 11,366 | Bounded Treewidth and the Infinite Core Chase: Complications and Workarounds toward Decidable Querying | 2023 | PODS |
| 8 | 10,639 | Circuit Bounds for Conjunctive Queries with Self-joins | 2025 | PODS |
| 9 | 11,527 | A Journey to the Frontiers of Query Rewritability | 2022 | PODS |
| 10 | 8,275 | On the BDD/FC Conjecture | 2013 | PODS |