Logics for approximating implication problems of saturated conditional independence
From MaRDI portal
Recommendations
- Sound approximate reasoning about saturated conditional probabilistic independence under controlled uncertainty
- Approximation logics for subclasses of probabilistic conditional independence and hierarchical dependence on incomplete data
- On the completeness of the semigraphoid axioms for deriving arbitrary from saturated conditional independence statements
- Logical and algorithmic properties of stable conditional independence
- Frontiers for propositional reasoning about fragments of probabilistic conditional independence and hierarchical database decompositions
Cited in
(6)- On the conditional independence implication problem: a lattice-theoretic approach
- Approximation logics for subclasses of probabilistic conditional independence and hierarchical dependence on incomplete data
- Sound approximate reasoning about saturated conditional probabilistic independence under controlled uncertainty
- An approximative inference method for solving ∃∀SO satisfiability problems
- A computational algebraic-geometry method for conditional-independence inference
- scientific article; zbMATH DE number 810104 (Why is no real title available?)
This page was built for publication: Logics for approximating implication problems of saturated conditional independence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2938496)