4 papers
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…
Axiomatizing modal inclusion logic and its variants
Aleksi Anttila, Matilda Häggblom, Fan Yang
We provide a complete axiomatization of modal inclusion logic - team-based modal logic extended with inclusion atoms. We review and refine an expressive completeness and normal for…