scientific article; zbMATH DE number 176109

zbMATH Open0764.60004MaRDI QIDQ4035210FDOQ4035210

Authors: Milan Studený 

Publication date: 18 May 1993

Title of this publication is not available (Why is that?)

Recommendations

• Gaussian conditional independence relations have no finite complete characterization
• A finite axiomatization of conditional independence and inclusion dependencies
• A finite axiomatization of conditional independence and inclusion dependencies
• scientific article; zbMATH DE number 4094468
• On the completeness of the semigraphoid axioms for deriving arbitrary from saturated conditional independence statements

zbMATH Keywords

embedded multivalued dependencyaxiomatization of conditional independenceconditional- independence relationssyntactic description of conditional independence

Mathematics Subject Classification ID

Foundations of probability theory (60A99)

Cited In (44)

• Marginals of DAG-Isomorphic Independence Models
• The geometry of Gaussian double Markovian distributions
• Axioms of causal relevance
• Title not available (Why is that?)
• The implication problem for functional dependencies and variants of marginal distribution equivalences
• Causal discovery and the problem of ignorance. An adaptive logic approach
• On the finite and general implication problems of independence atoms and keys
• Title not available (Why is that?)
• Generalized Permutohedra from Probabilistic Graphical Models
• A comparative study of possibilistic conditional independence and lack of interaction
• Reduction of database independence to dividing in atomless Boolean algebras
• Game Semantics for the Geiger-Paz-Pearl Axioms of Independence
• On the completeness of the semigraphoid axioms for deriving arbitrary from saturated conditional independence statements
• Acyclic directed graphs representing independence models
• Title not available (Why is that?)
• Approximation logics for subclasses of probabilistic conditional independence and hierarchical dependence on incomplete data
• Logical and algorithmic properties of stable conditional independence
• Sound approximate reasoning about saturated conditional probabilistic independence under controlled uncertainty
• Graphoid properties of epistemic irrelevance and independence
• On a hypergraph probabilistic graphical model
• Conditional independence and natural conditional functions
• Contribution of František Matúš to the research on conditional independence.
• Gaussoids are two-antecedental approximations of Gaussian conditional independence structures
• Title not available (Why is that?)
• A note on marginal and conditional independence
• Generalized rules of probabilistic independence
• Ranking functions and rankings on languages
• A logical approach to context-specific independence
• A Logical Approach to Context-Specific Independence
• On interchangeability of Nash equilibria in multi-player strategic games
• Independency relationships and learning algorithms for singly connected networks
• On Gaussian conditional independence structures
• The implication problem for functional dependencies and variants of marginal distribution equivalences
• A computational algebraic-geometry method for conditional-independence inference
• Frontiers for propositional reasoning about fragments of probabilistic conditional independence and hierarchical database decompositions
• A lattice-based representation of independence relations for efficient closure computation
• DESCRIPTION OF STRUCTURES OF STOCHASTIC CONDITIONAL INDEPENDENCE BY MEANS OF FACES AND IMSETS 1st part: introduction and basic concepts¹
• DESCRIPTION OF STRUCTURES OF STOCHASTIC CONDITIONAL INDEPENDENCE BY MEANS OF FACES AND IMSETS 2nd part: basic theory
• DESCRIPTION OF STRUCTURES OF STOCHASTIC CONDITIONAL INDEPENDENCE BY MEANS OF FACES AND IMSETS 3rd part: examples of use and appendices¹
• Two generalizations of the semi-graphoid rule of probabilistic independence and more
• Gaussian conditional independence relations have no finite complete characterization
• Racing algorithms for conditional independence inference
• Nested Markov properties for acyclic directed mixed graphs
• Concise representations and construction algorithms for semi-graphoid independency models

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4035210)