Logical and algorithmic properties of stable conditional independence

DOI10.1016/J.IJAR.2010.01.011MaRDI QIDQ985147zbMATH OpenOpenAlexFDO

Authors Mathias Niepert, D. Van Gucht, 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

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

Recommendations

• On the conditional independence implication problem: a lattice-theoretic approach
• Efficient algorithms for conditional independence inference
• Conditional independence in propositional logic.
• A logical notion of conditional independence: properties and applications
• Logical and algorithmic properties of conditional independence and graphical models

Cites work

• scientific article; zbMATH DE number 3888913 (Why is no real title available?)
• scientific article; zbMATH DE number 5595162 (Why is no real title available?)
• scientific article; zbMATH DE number 4094468 (Why is no real title available?)
• scientific article; zbMATH DE number 176091 (Why is no real title available?)
• scientific article; zbMATH DE number 176109 (Why is no real title available?)
• scientific article; zbMATH DE number 3598539 (Why is no real title available?)
• scientific article; zbMATH DE number 1113992 (Why is no real title available?)
• scientific article; zbMATH DE number 2150792 (Why is no real title available?)
• Conditional independence structure and its closure: inferential rules and algorithms
• Logical and algorithmic properties of conditional independence and graphical models
• On the conditional independence implication problem: a lattice-theoretic approach
• Racing algorithms for conditional independence inference
• Redundancy in logic. I: CNF propositional formulae

Cited in

(15)

• On the finite and general implication problems of independence atoms and keys
• Logics for approximating implication problems of saturated conditional independence
• Algorithms for computing minimal equivalent subformulas
• Appropriate inferences of data dependencies in relational databases
• Acyclic directed graphs representing independence models
• Logical and algorithmic properties of conditional independence and graphical models
• On the conditional independence implication problem: a lattice-theoretic approach
• Approximation logics for subclasses of probabilistic conditional independence and hierarchical dependence on incomplete data
• Sound approximate reasoning about saturated conditional probabilistic independence under controlled uncertainty
• Conditional independence structure and its closure: inferential rules and algorithms
• Conditional independencies under the algorithmic independence of conditionals
• Exploiting stability for compact representation of independency models
• scientific article; zbMATH DE number 2150792 (Why is no real title available?)
• Frontiers for propositional reasoning about fragments of probabilistic conditional independence and hierarchical database decompositions
• Racing algorithms for conditional independence inference

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q985147)