Graphoid properties of epistemic irrelevance and independence
type: Item
instance of: scholarly article
title: Graphoid properties of epistemic irrelevance and independence
zbMATH Open document ID: 1097.68128
author: Fabio G. Cozman
author: Peter Walley
published in: Annals of Mathematics and Artificial Intelligence
publication date: 2006-04-04T00:00:00Z
review text: This paper is based on the theory of coherent lover precisions, which represents one of the theories of the imprecise probability. The credal set is a second model for the imprecise probability, which is used here. Two concepts of the independence are concerned: the epistemic irrelevance and the epistemic independence. These two relations can violate several of the graphoid axioms. The epistemic irrelevance can violate the symmetry, contractions and intersections axioms. The epistemic independence can violate, the contraction and intersection properties. The graphoids are not sufficiently general to model the informal concept of the irrelevance.
reviewed by: Pavel Froněk
Mathematics Subject Classification ID: 68T37
Mathematics Subject Classification ID: 03B42
Mathematics Subject Classification ID: 03B48
Mathematics Subject Classification ID: 60A05
Mathematics Subject Classification ID: 05C99
zbMATH DE Number: 5016902
zbMATH Keywords: conditional independence
zbMATH Keywords: credal set
zbMATH Keywords: epistemic independence
zbMATH Keywords: graphoid axioms
zbMATH Keywords: imprecise probability
zbMATH Keywords: lower prevision
describes a project that uses: Separoids
describes a project that uses: TETRAD
MaRDI profile type: Publication
full work available at URL: s10472-005-9004-z
OpenAlex ID: W2073989874
cites work: Q4263000
cites work: Credal networks
cites work: Separoids: a mathematical framework for conditional independence and irrelevance
cites work: Axioms of causal relevance
cites work: Identifying independence in bayesian networks
cites work: Q4451078
cites work: Probabilistic logic
cites work: Qualitative methods for reasoning under uncertainty
cites work: Q3997653
cites work: Q4496846
cites work: On two pseudo-paradoxes in Bayesian analysis
cites work: Dilation for sets of probabilities
cites work: Q4035210
cites work: Semigraphoids and structures of probabilistic conditional independence
cites work: Epistemic independence for imprecise probabilities
cites work: Q3999364
cites work: Towards a frequentist theory of upper and lower probability
cites work: Direct algorithms for checking consistency and making inferences from conditional probability assessments
cites work: Fundamental concepts of qualitative probabilistic networks
DOI: 10.1007/S10472-005-9004-Z
description: scientific article; zbMATH DE number 5016902