Logical and algorithmic properties of stable conditional independence

DOI10.1016/j.ijar.2010.01.011zbMath1205.68428OpenAlexW2090932849MaRDI 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 complexitygraphical modelsconditional independenceconcise representationstable conditional independence

Mathematics Subject Classification ID

Knowledge representation (68T30) Reasoning under uncertainty in the context of artificial intelligence (68T37)

Related Items (7)

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

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

This page was built for publication: Logical and algorithmic properties of stable conditional independence