From Conditional Independences to Factorization Constraints with Discrete Random Variables

  • Authors:
  • F. M. Malvestuto

  • Affiliations:
  • Dipartimento di Scienze dell'Informazione, Università “La Sapienza”, 00198 Roma, Italy

  • Venue:
  • Annals of Mathematics and Artificial Intelligence
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

Factorization constraints are introduced as a generalization of the multiplicative formulation of conditional independence, and some computational and logic properties are stated. More precisely, we prove that factorization constraints characterize those cases in which a probability distribution can be represented “without loss of information” by a suitable set of its marginals. Moreover, we provide a sound formal system for factorization constraints, which covers the set of the so-called semi-graphoid axioms of conditional independence. Finally, we solve the implication problem for factorization constraints in two special cases, and for the general case we state two conditions, one necessary and the other sufficient for an implication to hold.