2000 character limit reached
The Implication Problem for Functional Dependencies and Variants of Marginal Distribution Equivalences (2312.03579v2)
Published 6 Dec 2023 in cs.LO
Abstract: We study functional dependencies together with two different probabilistic dependency notions: unary marginal identity and unary marginal distribution equivalence. A unary marginal identity states that two variables x and y are identically distributed. A unary marginal distribution equivalence states that the multiset consisting of the marginal probabilities of all the values for variable x is the same as the corresponding multiset for y. We present a sound and complete axiomatization for the class of these dependencies and show that it has Armstrong relations. The axiomatization is infinite, but we show that there can be no finite axiomatization. The implication problem for the subclass that contains only functional dependencies and unary marginal identities can be simulated with functional dependencies and unary inclusion atoms, and therefore the problem is in polynomial-time. This complexity bound also holds in the case of the full class, which we show by constructing a polynomial-time algorithm.
- Team Semantics and Independence Notions in Quantum Physics. arXiv:2107.10817 [math.LO]
- Rafael Albert and Erich Grädel. 2022. Unifying hidden-variable problems from quantum mechanics by logics of dependence and independence. Annals of Pure and Applied Logic (2022), 103088. https://doi.org/10.1016/j.apal.2022.103088
- William W. Armstrong. 1974. Dependency Structures of Data Base Relationships.. In Proc. of IFIP World Computer Congress. 580–583.
- Catriel Beeri and Philip A. Bernstein. 1979. Computational Problems Related to the Design of Normal Form Relational Schemas. ACM Trans. Database Syst. 4, 1 (1979), 30–59. https://doi.org/10.1145/320064.320066
- On the Structure of Armstrong Relations for Functional Dependencies. J. ACM 31, 1 (jan 1984), 30–46. https://doi.org/10.1145/2422.322414
- Ashok K. Chandra and Moshe Y. Vardi. 1985. The Implication Problem for Functional and Inclusion Dependencies is Undecidable. SIAM J. Comput. 14, 3 (1985), 671–677. https://doi.org/10.1137/0214049
- Polynomial-Time Implication Problems for Unary Inclusion Dependencies. J. ACM 37, 1 (1990), 15–46.
- Approximation and dependence via multiteam semantics. Ann. Math. Artif. Intell. 83, 3-4 (2018), 297–320. https://doi.org/10.1007/s10472-017-9568-4
- Ronald Fagin. 1982. Horn clauses and database dependencies. J. ACM 29 (1982), 952–985.
- Ronald Fagin and Moshe Y. Vardi. 1983. Armstrong databases for functional and inclusion dependencies. Inform. Process. Lett. 16, 1 (1983), 13–19. https://doi.org/10.1016/0020-0190(83)90005-4
- Pietro Galliani. 2012. Inclusion and exclusion dependencies in team semantics: On some logics of imperfect information. Annals of Pure and Applied Logic 163, 1 (2012), 68 – 84.
- Axioms and algorithms for inferences involving probabilistic independence. Information and Computation 91, 1 (1991), 128–141.
- Erich Grädel and Jouko Väänänen. 2013. Dependence and Independence. Studia Logica 101, 2 (2013), 399–410. https://doi.org/10.1007/s11225-013-9479-2
- Facets of Distribution Identities in Probabilistic Team Semantics. In JELIA (Lecture Notes in Computer Science, Vol. 11468). Springer, 304–320.
- On the finite and general implication problems of independence atoms and keys. J. Comput. System Sci. 82, 5 (2016), 856–877. https://doi.org/10.1016/j.jcss.2016.02.007
- Miika Hannula and Sebastian Link. 2018. On the Interaction of Functional and Inclusion Dependencies with Independence Atoms. In Database Systems for Advanced Applications, Jian Pei, Yannis Manolopoulos, Shazia Sadiq, and Jianxin Li (Eds.). Springer International Publishing, Cham, 353–369.
- Miika Hannula and Jonni Virtema. 2021. Tractability frontiers in probabilistic team semantics and existential second-order logic over the reals. arXiv:2012.12830 [cs.LO]
- Minna Hirvonen. 2022. The Implication Problem for Functional Dependencies and Variants of Marginal Distribution Equivalences. In Foundations of Information and Knowledge Systems, Ivan Varzinczak (Ed.). Springer International Publishing, Cham, 130–146.
- Wilfrid Hodges. 1997. Compositional Semantics for a Language of Imperfect Information. Journal of the Interest Group in Pure and Applied Logics 5 (4) (1997), 539–563.
- Warren-Dean Langeveldt and Sebastian Link. 2010. Empirical evidence for the usefulness of Armstrong relations in the acquisition of meaningful functional dependencies. Information Systems 35, 3 (2010), 352–374. https://doi.org/10.1016/j.is.2009.11.002
- Cheuk Ting Li. 2022. Undecidability of Network Coding, Conditional Information Inequalities, and Conditional Independence Implication. https://doi.org/10.48550/ARXIV.2205.11461
- Heikki Mannila and Kari-Jouko Räihä. 1986. Design by example: An application of Armstrong relations. J. Comput. System Sci. 33, 2 (1986), 126–141. https://doi.org/10.1016/0022-0000(86)90015-2
- Milan Studený. 1992. Conditional independence relations have no finite complete characterization. Kluwer, 377–396.
- Milan Studený. 1994. Semigraphoids are two-antecedental approximations of stochastic conditional independence models. Uncertainty in Artificial Intelligence, Proceedings of the Tenth Conference (1994), 546–552.
- Robert Tarjan. 1972. Depth first search and linear graph algorithms. SIAM JOURNAL ON COMPUTING 1, 2 (1972).
- Jouko Väänänen. 2007. Dependence Logic. Cambridge University Press.