Local consistency and axioms of functional dependence

• URL: http://arxiv.org/abs/2505.11057v1
• Date: Fri, 16 May 2025 09:55:34 GMT
• Title: Local consistency and axioms of functional dependence
• Authors: Timon Barlag, Miika Hannula, Juha Kontinen, Nina Pardal, Jonni Virtema,
• Abstract summary: We adopt a general approach to study logical inference in a setting that enables both global inconsistency and local consistency.<n>We investigate the entailment problem for functional dependencies (FDs) in this setting.<n>We provide a complete axiomatisation and a PTIME algorithm for the entailment problem of unary FDs.
• Score: 0.5126361628588282
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Local consistency arises in diverse areas, including Bayesian statistics, relational databases, and quantum foundations. Likewise, the notion of functional dependence arises in all of these areas. We adopt a general approach to study logical inference in a setting that enables both global inconsistency and local consistency. Our approach builds upon pairwise consistent families of K-relations, i.e, relations with tuples annotated with elements of some positive commutative monoid. The framework covers, e.g., families of probability distributions arising from quantum experiments and their possibilistic counterparts. As a first step, we investigate the entailment problem for functional dependencies (FDs) in this setting. Notably, the transitivity rule for FDs is no longer sound, but can be replaced by two novel axiom schemes. We provide a complete axiomatisation and a PTIME algorithm for the entailment problem of unary FDs. In addition, we explore when contextual families over the Booleans have realisations as contextual families over various monoids.

Related papers

• Flow-Based Non-stationary Temporal Regime Causal Structure Learning [49.77103348208835]
  We introduce FANTOM, a unified framework for causal discovery.<n>It handles non stationary processes along with non Gaussian and heteroscedastic noises.<n>It simultaneously infers the number of regimes and their corresponding indices and learns each regime's Directed Acyclic Graph.
  arXiv  Detail & Related papers  (2025-06-20T15:12:43Z)
• Meta-Dependence in Conditional Independence Testing [11.302018782958205]
  We study a "meta-dependence" between conditional independence properties using the following geometric intuition.<n>We provide a simple-to-compute measure of this meta-dependence using information projections and consolidate our findings empirically using both synthetic and real-world data.
  arXiv  Detail & Related papers  (2025-04-17T02:41:22Z)
• On Discovery of Local Independence over Continuous Variables via Neural Contextual Decomposition [26.34622544479565]
  We define and characterize the local independence relationship that holds in a specific set of joint assignments of parental variables. We propose a novel method, coined neural contextual decomposition (NCD), which learns such partition by imposing each set to induce CSSI.
  arXiv  Detail & Related papers  (2024-05-12T08:48:37Z)
• The Topology of Causality [0.0]
  We provide a unified framework for the study of causality, non-locality and contextuality. Our work has its roots in the sheaf-theoretic framework for contextuality by Abramsky and Brandenburger.
  arXiv  Detail & Related papers  (2023-03-13T14:20:22Z)
• Refining and relating fundamentals of functional theory [0.0]
  We explain why there exist six equivalent universal functionals, prove concise relations among them and conclude that the important notion of $v$-representability is relative to the scope and choice of variable. For systems with time-reversal symmetry, we explain why there exist six equivalent universal functionals, prove concise relations among them and conclude that the important notion of $v$-representability is relative to the scope and choice of variable.
  arXiv  Detail & Related papers  (2023-01-24T18:09:47Z)
• Relative Probability on Finite Outcome Spaces: A Systematic Examination of its Axiomatization, Properties, and Applications [0.0]
  This work proposes a view of probability as a relative measure rather than an absolute one. We focus on finite outcome spaces and develop three fundamental axioms that establish requirements for relative probability functions.
  arXiv  Detail & Related papers  (2022-12-30T05:16:57Z)
• Unifying different notions of quantum incompatibility into a strict hierarchy of resource theories of communication [60.18814584837969]
  We introduce the notion of q-compatibility, which unifies different notions of POVMs, channels, and instruments incompatibility. We are able to pinpoint exactly what each notion of incompatibility consists of, in terms of information-theoretic resources.
  arXiv  Detail & Related papers  (2022-11-16T21:33:31Z)
• Disentanglement of Correlated Factors via Hausdorff Factorized Support [53.23740352226391]
  We propose a relaxed disentanglement criterion - the Hausdorff Factorized Support (HFS) criterion - that encourages a factorized support, rather than a factorial distribution. We show that the use of HFS consistently facilitates disentanglement and recovery of ground-truth factors across a variety of correlation settings and benchmarks.
  arXiv  Detail & Related papers  (2022-10-13T20:46:42Z)
• Partial Counterfactual Identification from Observational and Experimental Data [83.798237968683]
  We develop effective Monte Carlo algorithms to approximate the optimal bounds from an arbitrary combination of observational and experimental data. Our algorithms are validated extensively on synthetic and real-world datasets.
  arXiv  Detail & Related papers  (2021-10-12T02:21:30Z)
• Disentangling Observed Causal Effects from Latent Confounders using Method of Moments [67.27068846108047]
  We provide guarantees on identifiability and learnability under mild assumptions. We develop efficient algorithms based on coupled tensor decomposition with linear constraints to obtain scalable and guaranteed solutions.
  arXiv  Detail & Related papers  (2021-01-17T07:48:45Z)
• Finite-Function-Encoding Quantum States [52.77024349608834]
  We introduce finite-function-encoding (FFE) states which encode arbitrary $d$-valued logic functions. We investigate some of their structural properties.
  arXiv  Detail & Related papers  (2020-12-01T13:53:23Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.