Propositional reasoning about saturated conditional probabilistic independence
From MaRDI portal
Recommendations
- Frontiers for propositional reasoning about fragments of probabilistic conditional independence and hierarchical database decompositions
- 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
- On the completeness of the semigraphoid axioms for deriving arbitrary from saturated conditional independence statements
- Conditional independence in propositional logic.
Cited in
(6)- On the completeness of the semigraphoid axioms for deriving arbitrary from saturated conditional independence statements
- Sound approximate reasoning about saturated conditional probabilistic independence under controlled uncertainty
- A computational algebraic-geometry method for conditional-independence inference
- scientific article; zbMATH DE number 1017516 (Why is no real title available?)
- Approximation logics for subclasses of probabilistic conditional independence and hierarchical dependence on incomplete data
- Frontiers for propositional reasoning about fragments of probabilistic conditional independence and hierarchical database decompositions
This page was built for publication: Propositional reasoning about saturated conditional probabilistic independence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2915032)