Lengths of Semigraphoid Inferences

Authors:
František Matúš
Affiliations:
Institute of Information Theory and Automation, Academy of Sciences of the Czech Republic, and Laboratory of Intelligent Systems, University of Economics, Prague, Czech Republic
Venue:
Annals of Mathematics and Artificial Intelligence
Year:
2002

Citing 2
Cited 0

Probabilistic reasoning in intelligent systems: networks of plausible inference

Probabilistic reasoning in intelligent systems: networks of plausible inference
Conditional independence structures examined via minors

Annals of Mathematics and Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

A subset ℒ of a semigraphoid iK over in elements is constructed in such a way that starting from ℒ it is necessary to apply semigraphoid axioms recursively 2in−2−1 times to arrive at iK. 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.