Please use this identifier to cite or link to this item:
Title: On the Conditional Independence Implication Problem: A Lattice-Theoretic Approach
Authors: Sayrafi, Bassem
Niepert, Mathias
Van Gucht, Dirk
Gyssens, Marc
Keywords: Logic, Symbolic and mathematical;Artificial intelligence
Issue Date: 2013
Abstract: 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 inclusion 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 “latticeexclusion” criterion in polynomial time. Finally, we provide experimental results that relate our work to results obtained from other existing inference algorithms
Appears in Collections:Fulltext Publications

Files in This Item:
File Description SizeFormat
1408.2030.pdf180.78 kBAdobe PDFView/Open
Show full item record

Page view(s)

Last Week
Last month
checked on Jun 27, 2024


checked on Jun 27, 2024

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.