On the BDD/FC Conjecture

TL;DR

This paper investigates the relationship between Bounded Derivation Depth and Finite Controllability in Datalog+/- programs, providing evidence that BDD implies FC, especially for theories over binary signatures.

Contribution

It conjectures that BDD implies FC and proves this for all theories over binary signatures, advancing understanding of these properties in Datalog+/-.

Findings

BDD implies FC for theories over binary signatures

Evidence supports the conjecture that BDD implies FC

The paper advances theoretical understanding of Datalog+/- properties

Abstract

Bounded Derivation Depth property (BDD) and Finite Controllability (FC) are two properties of sets of datalog rules and tuple generating dependencies (known as Datalog +/- programs), which recently attracted some attention. We conjecture that the first of these properties implies the second, and support this conjecture by some evidence proving, among other results, that it holds true for all theories over binary signature.