Computer Science – Artificial Intelligence
Scientific paper
2008-10-31
Proceedings of the 24th Conference on Uncertainty in Artificial Intelligence, 2008, pages 435-443
Computer Science
Artificial Intelligence
Scientific paper
A lattice-theoretic framework is introduced that permits the study of the conditional independence (CI) implication problem relative to the class of discrete probability measures. Semi-lattices are associated with CI statements and a finite, sound and complete inference system relative to semi-lattice inclusions is presented. This system is shown to be (1) sound and complete for saturated CI statements, (2) complete for general CI statements, and (3) sound and complete for stable CI statements. These results yield a criterion that can be used to falsify instances of the implication problem and several heuristics are derived that approximate this "lattice-exclusion" criterion in polynomial time. Finally, we provide experimental results that relate our work to results obtained from other existing inference algorithms.
Gucht Dirk Van
Gyssens Marc
Niepert Mathias
No associations
LandOfFree
On the Conditional Independence Implication Problem: A Lattice-Theoretic Approach does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On the Conditional Independence Implication Problem: A Lattice-Theoretic Approach, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Conditional Independence Implication Problem: A Lattice-Theoretic Approach will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-457242