scientific article; zbMATH DE number 176109
From MaRDI portal
Publication:4035210
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
Cited in
(51)- Gaussian conditional independence relations have no finite complete characterization
- Axioms of causal relevance
- A logical approach to context-specific independence
- Conditional independence and natural conditional functions
- A comparative study of possibilistic conditional independence and lack of interaction
- On a hypergraph probabilistic graphical model
- The implication problem for functional dependencies and variants of marginal distribution equivalences
- Generalized rules of probabilistic independence
- Gaussoids are two-antecedental approximations of Gaussian conditional independence structures
- A lattice-based representation of independence relations for efficient closure computation
- On the completeness of the semigraphoid axioms for deriving arbitrary from saturated conditional independence statements
- Concise representations and construction algorithms for semi-graphoid independency models
- Causal discovery and the problem of ignorance. An adaptive logic approach
- Sound approximate reasoning about saturated conditional probabilistic independence under controlled uncertainty
- Ranking functions and rankings on languages
- On the finite and general implication problems of independence atoms and keys
- A Logical Approach to Context-Specific Independence
- Reduction of database independence to dividing in atomless Boolean algebras
- Game Semantics for the Geiger-Paz-Pearl Axioms of Independence
- Marginals of DAG-Isomorphic Independence Models
- A computational algebraic-geometry method for conditional-independence inference
- scientific article; zbMATH DE number 4084634 (Why is no real title available?)
- scientific article; zbMATH DE number 4094468 (Why is no real title available?)
- Independency relationships and learning algorithms for singly connected networks
- scientific article; zbMATH DE number 1927371 (Why is no real title available?)
- Generalized Permutohedra from Probabilistic Graphical Models
- On interchangeability of Nash equilibria in multi-player strategic games
- DESCRIPTION OF STRUCTURES OF STOCHASTIC CONDITIONAL INDEPENDENCE BY MEANS OF FACES AND IMSETS 1st part: introduction and basic concepts1
- 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 appendices1
- Integrity constraints revisited: from exact to approximate implication
- Approximation logics for subclasses of probabilistic conditional independence and hierarchical dependence on incomplete data
- On Gaussian conditional independence structures
- Contribution of František Matúš to the research on conditional independence.
- Nested Markov properties for acyclic directed mixed graphs
- The geometry of Gaussian double Markovian distributions
- A note on marginal and conditional independence
- Two generalizations of the semi-graphoid rule of probabilistic independence and more
- Acyclic directed graphs representing independence models
- The implication problem for functional dependencies and variants of marginal distribution equivalences
- Decision problems in information theory
- Team semantics and independence notions in quantum physics
- Faithlessness in Gaussian graphical models
- Conditional independence on semiring relations
- Approximate implication for probabilistic graphical models
- Probabilistic judgment aggregation with conditional independence constraints
- On entropic and almost multilinear representability of matroids
- Frontiers for propositional reasoning about fragments of probabilistic conditional independence and hierarchical database decompositions
- Graphoid properties of epistemic irrelevance and independence
- Logical and algorithmic properties of stable conditional independence
- Racing algorithms for conditional independence inference
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)
