The L-separation criterion for description of cs-independence models

DOI10.1016/S0888-613X(01)00069-XzbMath1014.62002MaRDI QIDQ1603305

Barbara Vantaggi

Publication date: 11 July 2002

Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)

zbMATH Keywords

conditional probabilitiesdirected acyclic graphs

Mathematics Subject Classification ID

Applications of graph theory (05C90) Foundations and philosophical topics in statistics (62A01) Axioms; other general questions in probability (60A05)

Related Items (14)

DAG representation of asymmetric independence models arising in coherent conditional possibility theory ⋮ Credal networks under epistemic irrelevance ⋮ Computing lower and upper expectations under epistemic independence ⋮ Acyclic directed graphs representing independence models ⋮ Consequences of the minimum specificity principle on conditioning and on independence in possibility theory ⋮ Credal networks under epistemic irrelevance: the sets of desirable gambles approach ⋮ CONDITIONAL INDEPENDENCE STRUCTURES AND GRAPHICAL MODELS ⋮ Conditional independence structure and its closure: inferential rules and algorithms ⋮ Exploiting independencies to compute semigraphoid and graphoid structures ⋮ Possibility theory: conditional independence ⋮ Conditioning in a coherent setting: Theory and applications ⋮ The role of coherence for handling probabilistic evaluations and independence ⋮ Independence for full conditional probabilities: structure, factorization, non-uniqueness, and Bayesian networks ⋮ Asymmetric decomposability and persegram representation in coherent conditional probability theory

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finitely additive conditional probabilities, conglomerability and disintegrations
• Semigraphoids and structures of probabilistic conditional independence
• Independence and possibilistic conditioning
• Stochastic independence in a coherent setting
• On chain graph models for description of conditional independence structures
• Conditional independence in a coherent finite setting
• CONDITIONAL INDEPENDENCE RELATIONS IN POSSIBILITY THEORY
• Identifying independence in bayesian networks
• Coherent numerical and ordinal probabilistic assessments
• Representation of conditional probability measures on Boolean algebras

This page was built for publication: The L-separation criterion for description of cs-independence models