A linear-algebraic tool for conditional independence in- ference

[1] Marco Baioletti, Giuseppe Busanello, and Barbara Vantaggi. Conditional independence
structure and its closure: Inferential rules and algorithms. International Journal
of Approximate Reasoning, 50:1097{1114, 2009.
[2] Remco Bouckaert, Raymond Hemmecke, Silvia Lindner, and Milan Studeny. Ecient
algorithms for conditional independence inference. Journal of Machine Learning Research,
11:3453{3479, 2010.
[3] Mathias Drton, Bernd Sturmfels, and Seth Sullivant. Lectures on Algebraic Statistics.
Oberwolfach Seminars 39. Birkhauser, Basel, 2009.
[4] Dan Geiger, Azaria Paz, and Judea Pearl. Axioms and algorithms for inferences involving
probabilistic independence. Information and Computation, 91:128{141, 1991.
[5] Dan Geiger and Judea Pearl. Logical and algorithmic properties of conditional independence
and graphical models. The Annals of Statistics, 21:2001{2021, 1993.
[6] Raymond Hemmecke, Jason Morton, Anne Shiu, Bernd Sturmfels, and Oliver Wienand.
Three counter-examples on semi-graphoids. Combinatorics, Probability and
Computing, 17:239{257, 2008.
[7] Takuya Kashimura, Tomonari Sei, Akimichi Takemura, and Kentaro Tanaka. Cones
of elementary imsets and supermodular functions: a review and some new results.
In Proceedings of the Second CREST-SBM International Conference \Harmony of
Grobner Bases and the Modern Industrial Society", pages 117{152, 2012.
REFERENCES 167
[8] Francesco M. Malvestuto. A unique formal system for binary decomposition of
database relations, probability distributions and graphs. Information Sciences, 59:21{
52, 1992.
[9] Francesco M. Malvestuto and Milan Studeny. Comment on \a unique formal system
for binary decomposition of database relations, probability distributions and graphs".
Information Sciences, 63:1{2, 1992.
[10] Frantisek Matus. Stochastic independence, algebraic independence and abstract connectedness.
Theoretical Computer Science, 134:455{471, 1994.
[11] Mathias Niepert, Dirk Van Gucht, and Marc Gyssens. Logical and algorithmic properties
of stable conditional independence. International Journal of Approximate Reasoning,
51:531{543, 2010.
[12] Judea Pearl and Azaria Paz. Graphoids, graph-based logic for reasoning about relevance
relations. In L. Steels B. Du Boulay, D. Hogg, editor, In Advances in Articial
Intelligence, Volume II, pages 357{363, North-Holland, 1987.
[13] Wolfgang Spohn. On the properties of conditional independence. In Paul Humphreys,
editor, Patrick Suppes, Scientic Philosopher, Volume 1, Probability and Probabilistic
Causality, pages 173{196. Kluwer, 1994.
[14] Milan Studeny. Conditional independence relations have no nite complete characterization.
In J. A. Vsek S. Kubk, editor, Information Theory, Statistical Decision
Functions and Random Processes, Transactions of the 11th Prague Conference, Volume
B, pages 377{396. Kluwer, 1992.
[15] Milan Studeny. Probabilistic Conditional Independence Structures. Springer-Verlag,
London, 2005.
[16] Milan Studeny, Remco R. Bouckaert, and Tomas Kocka. Extreme supermodular set
functions over ve variables. Research report 1977, Institute of Information Theory
and Automation, Prague, 2000.