Original title: On the length of semigraphoid inference
Authors: Matúš, František
Document type: Papers
Conference/Event: WUPES '2000. Workshop on Uncertainty Processing /5./, Jindřichův Hradec (CZ), 2000-06-21 / 2000-06-24
Year: 2000
Language: eng
Abstract: 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
Project no.: AV0Z1075907 (CEP), IAA1075801 (CEP), VS96008 (CEP)
Funding provider: GA AV, MŠk
Host item entry: Proceedings of the 5th Workshop on Uncertainty Processing

Institution: Institute of Information Theory and Automation AS ČR (web)
Document availability information: Fulltext is available at the institute of the Academy of Sciences.
Original record: http://hdl.handle.net/11104/0130442

Permalink: http://www.nusl.cz/ntk/nusl-34783


The record appears in these collections:
Research > Institutes ASCR > Institute of Information Theory and Automation
Conference materials > Papers