0410352 20240103182207.820060210235959.9 80-245-0048-5 Praha VŠE 2000 5 s. 176-180VejnarováJ. 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 CR cav_un_auth*0012795 VS96008 MŠk CZ cav_un_auth*0025049 AV0Z1075907 A subset L of a semigraphoid K over n elements is constructed in such a way that starting from L it is necessary to apply semigraphoid axioms recursively 2^{n-2}-1 times to arrive at K. This is first known example of exponentially long semigraphoid inference. Graphoids and their duals are discussed as well. cav_un_auth*0212649 WUPES '2000. Workshop on Uncertainty Processing /5./ Jindřichův Hradec CZ 21.06.2000-24.06.2000 BA MTR http://hdl.handle.net/11104/0130442 UTIA-B 20000068 2000 2000 Praha VŠE 80-245-0048-5 Proceedings of the 5th Workshop on Uncertainty Processing 176 180 Vejnarová J. 340