Graphoid properties of epistemic irrelevance and independence
From MaRDI portal
Publication:819940
Recommendations
- Epistemic irrelevance on sets of desirable gambles
- Graphoid properties of concepts of independence for sets of probabilities
- Epistemic independence for imprecise probabilities
- Credal networks under epistemic irrelevance: the sets of desirable gambles approach
- scientific article; zbMATH DE number 1341461
Cites work
- scientific article; zbMATH DE number 48812 (Why is no real title available?)
- scientific article; zbMATH DE number 48344 (Why is no real title available?)
- scientific article; zbMATH DE number 176109 (Why is no real title available?)
- scientific article; zbMATH DE number 1341461 (Why is no real title available?)
- scientific article; zbMATH DE number 2046116 (Why is no real title available?)
- scientific article; zbMATH DE number 1493045 (Why is no real title available?)
- Axioms of causal relevance
- Credal networks
- Dilation for sets of probabilities
- Direct algorithms for checking consistency and making inferences from conditional probability assessments
- Epistemic independence for imprecise probabilities
- Fundamental concepts of qualitative probabilistic networks
- Identifying independence in bayesian networks
- On two pseudo-paradoxes in Bayesian analysis
- Probabilistic logic
- Qualitative methods for reasoning under uncertainty
- Semigraphoids and structures of probabilistic conditional independence
- Separoids: a mathematical framework for conditional independence and irrelevance
- Towards a frequentist theory of upper and lower probability
Cited in
(27)- Independent products in infinite spaces
- A survey of the theory of coherent lower previsions
- Computing lower and upper expectations under epistemic independence
- Credal networks under epistemic irrelevance
- Graphoid properties of concepts of independence for sets of probabilities
- Independent natural extension
- An algorithm to find a perfect map for graphoid structures
- Conditional independence structure and its closure: inferential rules and algorithms
- Sets of probability distributions, independence, and convexity
- Epistemic irrelevance in credal nets: the case of imprecise Markov trees
- Modelling epistemic irrelevance with choice functions
- On extreme points of p-boxes and belief functions
- Epistemic irrelevance on sets of desirable gambles
- Subjective causal networks and indeterminate suppositional credences
- Asymmetric decomposability and persegram representation in coherent conditional probability theory
- Bruno de Finetti and imprecision: imprecise probability does not exist!
- Probabilistic logic with independence
- Coherent choice functions under uncertainty
- Robust optimization approximation for ambiguous P-model and its application
- Acyclic directed graphs representing independence models
- Probability logic, logical probability, and inductive support
- DAG representation of asymmetric independence models arising in coherent conditional possibility theory
- Graphical models for imprecise probabilities
- GRAPHOID PROPERTIES OF QUALITATIVE POSSIBILISTIC INDEPENDENCE RELATIONS
- Credal networks under epistemic irrelevance: the sets of desirable gambles approach
- scientific article; zbMATH DE number 177460 (Why is no real title available?)
- Epistemic independence for imprecise probabilities
This page was built for publication: Graphoid properties of epistemic irrelevance and independence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q819940)
