Logical and algorithmic properties of stable conditional independence

DOI10.1016/j.ijar.2010.01.011zbMath1205.68428MaRDI QIDQ985147

Dirk Van Gucht, Mathias Niepert, Marc Gyssens

Publication date: 20 July 2010

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

Full work available at URL: https://doi.org/10.1016/j.ijar.2010.01.011

zbMATH Keywords

computational complexity; graphical models; conditional independence; concise representation; stable conditional independence

Mathematics Subject Classification ID

68T30: Knowledge representation

68T37: Reasoning under uncertainty in the context of artificial intelligence

Related Items

Approximation Logics for Subclasses of Probabilistic Conditional Independence and Hierarchical Dependence on Incomplete Data, On the finite and general implication problems of independence atoms and keys, Appropriate inferences of data dependencies in relational databases, Algorithms for computing minimal equivalent subformulas, Acyclic directed graphs representing independence models, Frontiers for propositional reasoning about fragments of probabilistic conditional independence and hierarchical database decompositions, Sound approximate reasoning about saturated conditional probabilistic independence under controlled uncertainty

Cites Work

• Conditional independence structure and its closure: inferential rules and algorithms
• Racing algorithms for conditional independence inference
• Logical and algorithmic properties of conditional independence and graphical models
• On the conditional independence implication problem: a lattice-theoretic approach
• Redundancy in logic. I: CNF propositional formulae
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item