Institute of Information Theory and Automation

You are here

Bibliography

Conference Paper (international conference)

On the length of semigraphoid inference

Matúš František

: Proceedings of the 5th Workshop on Uncertainty Processing, p. 176-180 , Eds: Vejnarová J.

: VŠE, (Praha 2000)

: WUPES '2000. Workshop on Uncertainty Processing /5./, (Jindřichův Hradec, CZ, 21.06.2000-24.06.2000)

: AV0Z1075907

: IAA1075801, GA AV, VS96008, MŠk

(eng): 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.

: 12A

: BA

2019-01-07 08:39