bibtype	J - Journal Article
ARLID	0410885
utime	20240103182246.3
mtime	20060210235959.9
title (primary) (eng)	Lenghts of semigraphoid inferences
specification	page_count 8 s.
serial	ARLID cav_un_epca*0250795 ISSN 1012-2443 title Annals of Mathematics and Artificial Intelligence volume_id 35 volume 4 (2002) page_num 287-294
keyword	semigraphoids
keyword	grahoids
keyword	inference length
author (primary)	ARLID cav_un_auth*0101161 name1 Matúš name2 František institution UTIA-B full_dept Department of Decision Making Theory fullinstit Ústav teorie informace a automatizace AV ČR, v. v. i.
COSATI	12A
cas_special	project project_id IAA1075801 agency GA AV ČR ARLID cav_un_auth*0012795 project project_id GA201/01/1482 agency GA ČR ARLID cav_un_auth*0005723 project project_id VS96008 agency GA MŠk ARLID cav_un_auth*0025049 research CEZ:AV0Z1075907 abstract (eng) 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. RIV BA department MTR permalink http://hdl.handle.net/11104/0130972 ID_orig UTIA-B 20020099 arlyear 2002 mrcbU63 cav_un_epca*0250795 Annals of Mathematics and Artificial Intelligence 1012-2443 1573-7470 Roč. 35 č. 4 2002 287 294