0410885 20240103182246.320060210235959.9 8 s. cav_un_epca*02507951012-2443354 (2002)287-294 semigraphoids grahoids inference length cav_un_auth*0101161 Matúš František UTIA-B Department of Decision Making Theory Ústav teorie informace a automatizace AV ČR, v. v. i. 12A IAA1075801 GA AV ČR cav_un_auth*0012795 GA201/01/1482 GA ČR cav_un_auth*0005723 VS96008 GA MŠk cav_un_auth*0025049 CEZ:AV0Z1075907 A subset of a semigraphoid over n elements is constructed in such a way that starting from the subset it is necessary to apply the semigraphoid axioms recursively 2^{n-2}-1 times to arrive at the semigraphoid. 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. BA MTR http://hdl.handle.net/11104/0130972 UTIA-B 20020099 2002 cav_un_epca*0250795 Annals of Mathematics and Artificial Intelligence 1012-2443 1573-7470 Roč. 35 č. 4 2002 287 294