The implication problem for functional dependencies and variants of marginal distribution equivalences
From MaRDI portal
Publication:6636619
DOI10.1145/3677120WikidataQ130887617 ScholiaQ130887617MaRDI QIDQ6636619FDOQ6636619
Publication date: 12 November 2024
Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)
polynomial-time algorithmcomplete axiomatizationfunctional dependencyArmstrong relationsinclusion dependencymarginal distribution equivalenceprobabilistic team semantics
Cites Work
- Axioms and algorithms for inferences involving probabilistic independence
- Dependence and independence
- Dependence logic. A new approach to independence friendly logic
- Title not available (Why is that?)
- Inclusion and exclusion dependencies in team semantics -- on some logics of imperfect information
- Compositional semantics for a language of imperfect information
- Depth-First Search and Linear Graph Algorithms
- On the finite and general implication problems of independence atoms and keys
- Polynomial-time implication problems for unary inclusion dependencies
- The Implication Problem for Functional and Inclusion Dependencies is Undecidable
- Horn clauses and database dependencies
- Title not available (Why is that?)
- Unifying hidden-variable problems from quantum mechanics by logics of dependence and independence
- Armstrong databases for functional and inclusion dependencies
- On the Structure of Armstrong Relations for Functional Dependencies
- Design by example: An application of Armstrong relations
- Approximation and dependence via multiteam semantics
- The implication problem for functional dependencies and variants of marginal distribution equivalences
- Facets of distribution identities in probabilistic team semantics
This page was built for publication: The implication problem for functional dependencies and variants of marginal distribution equivalences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6636619)
