A finite axiomatization of conditional independence and inclusion dependencies

09/19/2013
by   Miika Hannula, et al.
0

We present a complete finite axiomatization of the unrestricted implication problem for inclusion and conditional independence atoms in the context of dependence logic. For databases, our result implies a finite axiomatization of the unrestricted implication problem for inclusion, functional, and embedded multivalued dependencies in the unirelational case.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/07/2021

On the Interaction of Functional and Inclusion Dependencies with Independence Atoms

Infamously, the finite and unrestricted implication problems for the cla...
research
04/12/2019

Axiomatizing first-order consequences in inclusion logic

Inclusion logic is a variant of dependence logic that was shown to have ...
research
01/10/2013

On characterizing Inclusion of Bayesian Networks

Every directed acyclic graph (DAG) over a finite non-empty set of variab...
research
03/24/2021

The Complexity of Dependency Detection and Discovery in Relational Databases

Multi-column dependencies in relational databases come associated with t...
research
06/19/2023

Convergent spectral inclusion sets for banded matrices

We obtain sequences of inclusion sets for the spectrum, essential spectr...
research
03/05/2020

Finite Open-World Query Answering with Number Restrictions

Open-world query answering is the problem of deciding, given a set of fa...
research
12/26/2019

Solving a Special Case of the Intensional vs Extensional Conjecture in Probabilistic Databases

We consider the problem of exact probabilistic inference for Union of Co...

Please sign up or login with your details

Forgot password? Click here to reset