2025/05/26 by Matilda Häggblom, Häggblom, Matilda
Computer Science · Decision Sciences · #03B60 #03B70 #Advanced Algebra and Logic #F.4.1 #FOS: Computer and information sciences #FOS: Mathematics #Fuzzy and Soft Set Theory #H.2.4 #Logic (math.LO) #Logic in Computer Science (cs.LO) #Multi-Criteria Decision Making
paper · pdf · doi:10.48550/arxiv.2505.19834
openalex publication_date 2025/05/26 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We introduce two approximate variants of inclusion dependencies and examine the axiomatization and computational complexity of their implication problems. The approximate variants allow for some imperfection in the database and differ in how this degree is measured. One considers the error relative to the database size, while the other applies a fixed threshold independent of size. We obtain complete axiomatizations for both under some arity restrictions. In particular, restricted to unary inclusion dependencies, the implication problem for each approximate variant is decidable in PTIME. We formalise the results using team semantics, where a team corresponds to a uni-relational database.