No Cliques Allowed: The Next Step Towards BDD/FC Conjecture

2026-03-10

AI Summary

This study addresses a central open problem in existential rule reasoning: whether bounded derivation depth (BDD) rule sets enjoy finite controllability (FC). By integrating logical reasoning, model theory, and graph-theoretic analysis—particularly leveraging tournament structures—the work establishes that in the universal models generated by BDD rule sets, the presence of arbitrarily large tournaments necessarily entails the satisfaction of the self-loop query ∃x E(x,x). This result reveals an intrinsic connection between tournament size and the emergence of self-loops, thereby ruling out a broad class of potential counterexamples to the BDD ⇒ FC conjecture. The finding provides a crucial structural constraint that significantly advances the conjecture toward a positive resolution.

Technology Category

• Knowledge Representation and Reasoning: Computational Complexity of Reasoning
• Reasoning under Uncertainty: Other Foundations of Reasoning under Uncertainty
• Constraint Satisfaction and Optimization: Satisfiability Modulo Theories

Application Category

• Graph Algorithms and Modeling for the Web: Foundation models and LLMs for Web-related graphs
• Semantics and Knowledge: Scalable techniques for the creation, curation, publication, maintenance, and consumption of large, Web-based, structured, reusable, knowledge graphs and ontologies
• Web Mining and Content Analysis: Models for Web evolution

Abstract

This paper addresses one of the fundamental open questions in the realm of existential rules: the conjecture on the finite controllability of bounded derivation depth rule sets (bdd $\Rightarrow$ fc). We take a step toward a positive resolution of this conjecture by demonstrating that universal models generated by bdd rule sets cannot contain arbitrarily large tournaments (arbitrarily directed cliques) without entailing a loop query, $\exists{x} E(x, x)$. This simple yet elegant result narrows the space of potential counterexamples to the (bdd $\Rightarrow$ fc) conjecture.

Problem

• existential rules
• bounded derivation depth
• finite controllability
• conjecture
• tournaments

Innovation

• bounded derivation depth
• finite controllability
• existential rules
• universal models
• tournaments