Database Paper Browser

Back to papers

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)

Paper ID
1972
Venue
PODS
Year
2025
Pagerank
4.1945683e-05
Overall Rank
10,350 | 28.00%
DOI
10.1145/3725238

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

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
38 Testing Implications Of Data Dependencies 1979 SIGMOD 0.00075110004
144 Testing Containment of Conjunctive Queries Under Functional and Inclusion Dependencies (Extended Abstract) 1982 PODS 0.00041462501
698 The Chase Revisited 2008 PODS 0.00018030148
2,755 Advanced Processing for Ontological Queries 2010 VLDB 8.1690695e-05
7,957 On the BDD/FC Conjecture 2013 PODS 4.613363e-05
11,328 A Journey to the Frontiers of Query Rewritability 2022 PODS 4.1945683e-05
Previous Page 1 / 1 Next

Semantically Similar Papers