most citedAxiomatizing modal inclusion logic and its variants

2 citations · 2 across the 2 of their papers we have counts for

collaborators

2 papers

cs.LO2026

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…

math.LO2023★ 2 cited

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…