Strong conditional independence for credal sets
From MaRDI portal
Publication:1601912
DOI10.1023/A:1014555822314zbMath1005.60006OpenAlexW1528128327MaRDI QIDQ1601912
Publication date: 27 June 2002
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1014555822314
Reasoning under uncertainty in the context of artificial intelligence (68T37) Foundations of probability theory (60A99) Axioms; other general questions in probability (60A05)
Related Items (20)
Epistemic irrelevance on sets of desirable gambles ⋮ Statistics and causal inference: A review. (With discussion) ⋮ DAG representation of asymmetric independence models arising in coherent conditional possibility theory ⋮ An Algorithm to Find a Perfect Map for Graphoid Structures ⋮ Coherence graphs ⋮ Graphical models for imprecise probabilities ⋮ Computing lower and upper expectations under epistemic independence ⋮ Hill-climbing and branch-and-bound algorithms for exact and approximate inference in credal networks ⋮ Sets of probability distributions, independence, and convexity ⋮ Compositional models for credal sets ⋮ A behavioural justification for using sensitivity analysis in imprecise multinomial processes ⋮ On extreme points of p-boxes and belief functions ⋮ Acyclic directed graphs representing independence models ⋮ Independent products in infinite spaces ⋮ Graphoid properties of concepts of independence for sets of probabilities ⋮ Decision-theoretic specification of credal networks: a unified language for uncertain modeling with sets of Bayesian networks ⋮ Conditional independence structure and its closure: inferential rules and algorithms ⋮ Compositional models and conditional independence in evidence theory ⋮ Computing probability intervals with simulated annealing and probability trees ⋮ Updating beliefs with incomplete observations
This page was built for publication: Strong conditional independence for credal sets
