Graphoid properties of epistemic irrelevance and independence
DOI10.1007/S10472-005-9004-ZzbMATH Open1097.68128OpenAlexW2073989874MaRDI QIDQ819940FDOQ819940
Authors: Fabio G. Cozman, Peter Walley 
Publication date: 4 April 2006
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10472-005-9004-z
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
conditional independenceimprecise probabilityepistemic independencelower previsioncredal setgraphoid axioms
Reasoning under uncertainty in the context of artificial intelligence (68T37) Probability and inductive logic (03B48) Logics of knowledge and belief (including belief change) (03B42) Graph theory (05C99) Axioms; other general questions in probability (60A05)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Identifying independence in bayesian networks
- Title not available (Why is that?)
- Probabilistic logic
- Title not available (Why is that?)
- Semigraphoids and structures of probabilistic conditional independence
- Towards a frequentist theory of upper and lower probability
- Dilation for sets of probabilities
- Epistemic independence for imprecise probabilities
- Direct algorithms for checking consistency and making inferences from conditional probability assessments
- Credal networks
- Separoids: a mathematical framework for conditional independence and irrelevance
- Qualitative methods for reasoning under uncertainty
- On two pseudo-paradoxes in Bayesian analysis
- Fundamental concepts of qualitative probabilistic networks
- Axioms of causal relevance
- Title not available (Why is that?)
Cited In (26)
- Computing lower and upper expectations under epistemic independence
- DAG representation of asymmetric independence models arising in coherent conditional possibility theory
- GRAPHOID PROPERTIES OF QUALITATIVE POSSIBILISTIC INDEPENDENCE RELATIONS
- Epistemic irrelevance in credal nets: the case of imprecise Markov trees
- Subjective causal networks and indeterminate suppositional credences
- Graphical models for imprecise probabilities
- Graphoid properties of concepts of independence for sets of probabilities
- Acyclic directed graphs representing independence models
- Coherent choice functions under uncertainty
- Conditional independence structure and its closure: inferential rules and algorithms
- An algorithm to find a perfect map for graphoid structures
- On extreme points of p-boxes and belief functions
- Sets of probability distributions, independence, and convexity
- Asymmetric decomposability and persegram representation in coherent conditional probability theory
- Probability logic, logical probability, and inductive support
- Credal networks under epistemic irrelevance: the sets of desirable gambles approach
- Independent products in infinite spaces
- A survey of the theory of coherent lower previsions
- Independent natural extension
- Epistemic irrelevance on sets of desirable gambles
- Epistemic independence for imprecise probabilities
- Bruno de Finetti and imprecision: imprecise probability does not exist!
- Credal networks under epistemic irrelevance
- Probabilistic logic with independence
- Robust optimization approximation for ambiguous P-model and its application
- Title not available (Why is that?)
Uses Software
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)
