The following pages link to (Q4035210):
Displaying 41 items.
- A logical approach to context-specific independence (Q122510) (← links)
- On the finite and general implication problems of independence atoms and keys (Q269507) (← links)
- Reduction of database independence to dividing in atomless Boolean algebras (Q283121) (← links)
- A computational algebraic-geometry method for conditional-independence inference (Q372231) (← links)
- On interchangeability of Nash equilibria in multi-player strategic games (Q484921) (← links)
- A note on marginal and conditional independence (Q613142) (← links)
- Acyclic directed graphs representing independence models (Q622277) (← links)
- Frontiers for propositional reasoning about fragments of probabilistic conditional independence and hierarchical database decompositions (Q744991) (← links)
- Graphoid properties of epistemic irrelevance and independence (Q819940) (← links)
- Logical and algorithmic properties of stable conditional independence (Q985147) (← links)
- Racing algorithms for conditional independence inference (Q997057) (← links)
- Gaussian conditional independence relations have no finite complete characterization (Q1017668) (← links)
- Axioms of causal relevance (Q1127350) (← links)
- Conditional independence and natural conditional functions (Q1344261) (← links)
- A comparative study of possibilistic conditional independence and lack of interaction (Q1809378) (← links)
- On a hypergraph probabilistic graphical model (Q2023886) (← links)
- The implication problem for functional dependencies and variants of marginal distribution equivalences (Q2103913) (← links)
- Generalized rules of probabilistic independence (Q2146060) (← links)
- Gaussoids are two-antecedental approximations of Gaussian conditional independence structures (Q2149807) (← links)
- A lattice-based representation of independence relations for efficient closure computation (Q2206476) (← links)
- On the completeness of the semigraphoid axioms for deriving arbitrary from saturated conditional independence statements (Q2252644) (← links)
- Concise representations and construction algorithms for semi-graphoid independency models (Q2374537) (← links)
- Causal discovery and the problem of ignorance. An adaptive logic approach (Q2390654) (← links)
- Sound approximate reasoning about saturated conditional probabilistic independence under controlled uncertainty (Q2446551) (← links)
- Ranking functions and rankings on languages (Q2457635) (← links)
- A Logical Approach to Context-Specific Independence (Q2820693) (← links)
- Game Semantics for the Geiger-Paz-Pearl Axioms of Independence (Q3094009) (← links)
- Marginals of DAG-Isomorphic Independence Models (Q3638147) (← links)
- Independency relationships and learning algorithms for singly connected networks (Q4421280) (← links)
- Generalized Permutohedra from Probabilistic Graphical Models (Q4601214) (← links)
- DESCRIPTION OF STRUCTURES OF STOCHASTIC CONDITIONAL INDEPENDENCE BY MEANS OF FACES AND IMSETS 1st part: introduction and basic concepts<sup>1</sup> (Q4861641) (← links)
- DESCRIPTION OF STRUCTURES OF STOCHASTIC CONDITIONAL INDEPENDENCE BY MEANS OF FACES AND IMSETS 2nd part: basic theory (Q4861645) (← links)
- DESCRIPTION OF STRUCTURES OF STOCHASTIC CONDITIONAL INDEPENDENCE BY MEANS OF FACES AND IMSETS 3rd part: examples of use and appendices<sup>1</sup> (Q4861653) (← links)
- (Q5028458) (← links)
- Approximation Logics for Subclasses of Probabilistic Conditional Independence and Hierarchical Dependence on Incomplete Data (Q5213646) (← links)
- (Q5446611) (← links)
- Contribution of Frantisek Matus to the research on conditional independence (Q5858538) (← links)
- Nested Markov properties for acyclic directed mixed graphs (Q6042349) (← links)
- The geometry of Gaussian double Markovian distributions (Q6049755) (← links)
- Two generalizations of the semi-graphoid rule of probabilistic independence and more (Q6178724) (← links)
- The implication problem for functional dependencies and variants of marginal distribution equivalences (Q6636619) (← links)
