Logical inference algorithms and matrix representations for probabilistic conditional independence

Proceedings of the 25th Conference on Uncertainty in Artificial Intelligence, UAI 2009

Volumn , Issue , 2009, Pages 428-435

  Niepert, Mathias ^a  

^a INDIANA UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; LINEAR PROGRAMMING;

CONDITIONAL INDEPENDENCES; CONSTRAINT-BASED; GRAPHICAL MODEL; IMPLICATION PROBLEM; LOGICAL INFERENCE; MATRIX REPRESENTATION; PROBABILISTIC CONDITIONALS; STRUCTURE-LEARNING;

INFERENCE ENGINES;

EID: 77955230140     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. S. Renooij, H. J. M. Tabachneck-Schijf, S. M. Mahoney (eds.) Proceedings of the 6th UAI Bayesian Modelling Applications Workshop, 2008.
2. M. Druzdzel and L. C. van der Gaag. Elicitation of Probabilities for Belief Networks: Combining Qualitative and Quantitative Information. Proceedings of the 11th Conference on Uncertainty in Artificial Intelligence, pages 141-148, 1995.
3. R. Dechter. Constraint Processing. Morgan Kaufmann Publishers Inc., 2003.
4. D. Geiger and J. Pearl. Logical and algorithmic properties of conditional independence and graphical models. The Annals of Statistics, 21(4):2001-2021, 1993.
5. M. Studený. Complexity of structural models. Proceedings of the 13th Prague Conference on Information Theory, Statistical Decision Functions and Random Processes, pages 521-528, 1998.
6. P. de Waal and L. C. van der Gaag. Stable independence and complexity of representation. Proceedings of the 20th Conference on Uncertainty in Artificial Intelligence, pages 112-119, 2004.
7. P. Gandhi, F. Bromberg, and D. Margaritis. Learning Markov Network Structure using Few Independence Tests. Proceedings of the SIAM Conference on Data Mining, pages 680-691, 2008.
8. A. Tarski. A Decision Method for Elementary Algebra and Geometry, 2nd edition. University of California Press, 1951.
9. R. R. Bouckaert and M. Studený. Racing algorithms for conditional independence inference. Int. J. Approx. Reasoning, 45(2):386-401, 2007. (Pubitemid 46887651)
10. G. E. Collins. Quantifier Elimination by Cylindrical Algebraic Decomposition-Twenty Years of Progress. Quantifier Elimination and Cylindrical Algebraic Decomposition Springer-Verlag, pages 8-23, 1998.
11. A. P. Dawid. Conditional Independence in Statistical Theory. Journal of the Royal Statistical Society, 41:1-31, 1979.
12. M. Niepert, D. Van Gucht, and M. Gyssens. On the conditional independence implication problem: A lattice-theoretic approach. Proceedings of the 24th Conference on Uncertainty in Artificial Intelligence, pages 435-443, 2008.
13. M. Niepert and D. Van Gucht. Logical Properties of Stable Conditional Independence. Proceedings of the 4th European Workshop on Probabilistic Graphical Models, pages 225-232, 2008.
14. B. Sayrafi and D. Van Gucht. Differential constraints. Proceedings of the ACM PODS Conference, pages 348-357, 2005. (Pubitemid 43275497)
15. F. Matúš. Ascending and descending conditional independence relations. Transactions of the 11th Prague Conference on Information Theory, pages 189-200, 1992.
16. J. Pearl. Probabilistic reasoning in intelligent systems: networks of plausible inference. Morgan Kaufmann Publishers Inc., 1988.
17. M. Studený. Probabilistic Conditional Independence Structures. Springer-Verlag, 2005.
18. A. Schrijver. Theory of Linear and Integer Programming. John Wiley & Sons, Inc, 1986.
19. B. Fitelson. A Decision Procedure for Probability Calculus with Applications. The Review of Symbolic Logic, 1:111-125, 2008.
20. R. Hemmecke, J. Morton, A. Shiu, and B. Sturmfels. Three counter-examples on semigraphoids. Combinatorics, Probability and Computing, 17(2):239-257, 2008.