Exploiting independencies to compute semigraphoid and graphoid structures

Baioletti, 2009, Conditional independence structure and its closure: inferential rules and algorithms, International Journal of Approximate Reasoning, 50, 1097, 10.1016/j.ijar.2009.05.002 M. Baioletti, G. Busanello, B. Vantaggi, Exploiting unconditional independencies in semigraphoid closure computation, in: Proceedings of the Uncertainty Processing (WUPES’09), 2009, pp. 1–12. M. Baioletti, G. Busanello, B. Vantaggi, Acyclic directed graphs to represent conditional independence models, Lecture Notes LNAI 5590, Springer-Verlag, Berlin, Heidelberg, 2009, pp. 530–541. Bouckaert, 2007, Racing algorithm for conditional independence inference, International Journal of Approximate Reasoning, 45, 386, 10.1016/j.ijar.2006.06.018 Coletti, 2000, 185 Coletti, 2002 Cox, 1996 Dawid, 1979, Conditional independence in statistical theory, Journal of the Royal Statistical Society B, 41, 15 Dawid, 2001, Separoids: a mathematical framework for conditional independence and irrelevance. Representations of uncertainty, Annals of Mathematics and Artificial Intelligence, 32, 335, 10.1023/A:1016734104787 B. de Finetti, Sull’impostazione assiomatica del calcolo delle probabilità, Annali Univ. Trieste 19 (1959) 3–55 (Chapter 5 in Probability, Induction, Statistics, Wiley, London). Geiger, 1991, Axioms and algorithms for inferences involving probabilistic independence, Information and Computation, 91, 128, 10.1016/0890-5401(91)90077-F Geiger, 1993, Logical and algorithmic properties of conditional independence and graphical models, Annals of Statistics, 21, 2001, 10.1214/aos/1176349407 Lauritzen, 1996 Matúš, 1994, Stochastic independence algebraic independence and abstract connectedness, Theoretical Computer Science, 134, 455, 10.1016/0304-3975(94)90248-8 F. Matúš, On the length of semigraphoid inference, in: Proceedings of the 5th WUPES Jindrichuv Hradec, 2000, pp. 176–180. Pearl, 1988 San Martı`n, 2005, Ignorable common information, null sets and Basu’s first theorem, Sankhya, 67, 674 Studený, 1995, Conditional independence and natural conditional functions, International Journal of Approximate Reasoning, 12, 43, 10.1016/0888-613X(94)00014-T Studený, 1997, Semigraphoids and structures of probabilistic conditional independence, Annals of Mathematics and Artificial Intelligence, 21, 71, 10.1023/A:1018905100242 M. Studený, Complexity of structural models, in: Proceedings of the Prague Stochastics ’98, Prague, 1998, pp. 521–528. M. Studený, Conditional independence relations have no finite complete characterization, in: Information Theory Statistical Decision Functions and Random Processes, Transaction of the Eleventh Prague Conference, 1998, pp. 377–396. Studený, 2002, On stochastic conditional independence: the problems of characterization and description, Annals of Mathematics and Artificial Intelligence, 35, 241, 10.1023/A:1014559906385 Vantaggi, 2001, Conditional independence in a coherent setting, Annals of Mathematics and Artificial Intelligence, 32, 287, 10.1023/A:1016730003879 Vantaggi, 2002, The L-separation criterion for description of cs-independence models, International Journal of Approximate Reasoning, 29, 291, 10.1016/S0888-613X(01)00069-X Vantaggi, 2005, The role of coherence for handling probabilistic evaluations and independence, Soft Computing, 69, 617, 10.1007/s00500-004-0407-2 Witthaker, 1990 Wong, 2000, On the implication problem for probabilistic conditional independency, IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans, 30, 785, 10.1109/3468.895901