The implication problem for functional dependencies and variants of marginal distribution equivalences
DOI10.1007/978-3-031-11321-5_8OpenAlexW4285177942MaRDI QIDQ2103913
Publication date: 9 December 2022
Full work available at URL: https://doi.org/10.1007/978-3-031-11321-5_8
polynomial-time algorithmfunctional dependencecomplete axiomatizationArmstrong relationsmarginal distribution equivalenceprobabilistic team semantics
Database theory (68P15) Logic in artificial intelligence (68T27) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Design by example: An application of Armstrong relations
- Inclusion and exclusion dependencies in team semantics -- on some logics of imperfect information
- Armstrong databases for functional and inclusion dependencies
- Axioms and algorithms for inferences involving probabilistic independence
- Approximation and dependence via multiteam semantics
- Dependence and independence
- Unifying hidden-variable problems from quantum mechanics by logics of dependence and independence
- Facets of distribution identities in probabilistic team semantics
- Polynomial-time implication problems for unary inclusion dependencies
- Undirected connectivity in log-space
- The Implication Problem for Functional and Inclusion Dependencies is Undecidable
- On the Structure of Armstrong Relations for Functional Dependencies
- Horn clauses and database dependencies
- Compositional semantics for a language of imperfect information
- Depth-First Search and Linear Graph Algorithms
- Tractability frontiers in probabilistic team semantics and existential second-order logic over the reals
This page was built for publication: The implication problem for functional dependencies and variants of marginal distribution equivalences
