Logical and algorithmic properties of stable conditional independence
DOI10.1016/J.IJAR.2010.01.011zbMATH Open1205.68428OpenAlexW2090932849MaRDI QIDQ985147FDOQ985147
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
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
computational complexitygraphical modelsconditional independenceconcise representationstable conditional independence
Reasoning under uncertainty in the context of artificial intelligence (68T37) Knowledge representation (68T30)
Cites Work
- On the conditional independence implication problem: a lattice-theoretic approach
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Logical and algorithmic properties of conditional independence and graphical models
- Redundancy in logic. I: CNF propositional formulae
- Title not available (Why is that?)
- Title not available (Why is that?)
- Conditional independence structure and its closure: inferential rules and algorithms
- Title not available (Why is that?)
- Racing algorithms for conditional independence inference
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (12)
- On the finite and general implication problems of independence atoms and keys
- 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
- Sound approximate reasoning about saturated conditional probabilistic independence under controlled uncertainty
- Conditional independence structure and its closure: inferential rules and algorithms
- Title not available (Why is that?)
- Frontiers for propositional reasoning about fragments of probabilistic conditional independence and hierarchical database decompositions
- Approximation Logics for Subclasses of Probabilistic Conditional Independence and Hierarchical Dependence on Incomplete Data
- 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)
