Inclusion with repetitions and Boolean constants -- implication problems revisited

DOI10.1007/978-3-032-04590-4_8MaRDI QIDQ6884719zbMATH OpenFDO

Authors Matilda Häggblom

Publication date 15 December 2025

Full work available at URL https://doi.org/10.1007/978-3-032-04590-4_8

zbMATH Keywords

axiomatizationBoolean inclusioncomputational complexityimplication probleminclusion dependencyteam semantics

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Cites work

• An atom’s worth of anonymity
• Axiomatizing modal inclusion logic and its variants
• Compositional semantics for a language of imperfect information
• Dependence logic. A new approach to independence friendly logic
• Horn clauses and database dependencies
• scientific article; zbMATH DE number 1086489 (Why is no real title available?)
• Inclusion and exclusion dependencies in team semantics -- on some logics of imperfect information
• Inclusion dependencies and their interaction with functional dependencies
• On dependence logic
• Propositional logics of dependence
• Propositional union closed team logics
• The complexity of theorem-proving procedures
• The expressive power of modal logic with inclusion atoms

This page was built for publication: Inclusion with repetitions and Boolean constants -- implication problems revisited

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6884719)