4 papers · 1 filter
Approximate Functional Dependencies---Implication Problem Revisited
Nicolas Fröhlich, Matilda Häggblom, Åsa Hirvonen +1
Functional dependencies are an important and well-studied class of database constraints that correspond to a notion expressed by dependence atoms in team logic. In practice, data o…
Axiomatizing approximate inclusion
Matilda Häggblom
We introduce two approximate variants of inclusion dependencies and examine the axiomatization and computational complexity of their implication problems. The approximate variants…
Inclusion with repetitions and Boolean constants -- implication problems revisited
Matilda Häggblom
Inclusion dependencies form one of the most widely used dependency classes. We extend existing results on the axiomatization and computational complexity of their implication probl…
Axiomatization of approximate exclusion
Matilda Häggblom
We define and axiomatize approximate exclusion atoms in the team semantic setting. A team is a set of assignments, which can be seen as a mathematical model of a uni-relational dat…