Abstract
A subset ℒ of a semigraphoid K over n elements is constructed in such a way that starting from ℒ it is necessary to apply semigraphoid axioms recursively 2n−2−1 times to arrive at K. This is first known example of exponentially long semigraphoid inference. A comparison is made between local and global inferences. Graphoids and their duals are discussed as well.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
F. MatÚš, On equivalence of Markov properties over undirected graphs, J. Appl. Probab. 29 (1992) 745-749.
F. MatÚš, Conditional independence structures examined via minors, Ann. Math. Artif. Intell. 21 (1997) 99-128.
F. MatÚš, Towards classification of semigraphoids, submitted to Discrete Math. (2001).
J. Pearl, Probabilistic Reasoning in Intelligent Systems (Morgan Kaufman, San Mateo, CA, 1988).
S. Ur and A. Paz, Some aspects of the membership problem for graphoids, Technical Report 677, Technion-Israel Institute of Technology, Haifa, Israel (1991).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Matúš, F. Lengths of Semigraphoid Inferences. Annals of Mathematics and Artificial Intelligence 35, 287–294 (2002). https://doi.org/10.1023/A:1014525817725
Issue Date:
DOI: https://doi.org/10.1023/A:1014525817725