| bibtype |
C -
Conference Paper (international conference)
|
| ARLID |
0410352 |
| utime |
20240103182207.8 |
| mtime |
20060210235959.9 |
| ISBN |
80-245-0048-5 |
| title
(primary) (eng) |
On the length of semigraphoid inference |
| publisher |
| place |
Praha |
| name |
VŠE |
| pub_time |
2000 |
|
| specification |
|
| serial |
| title
|
Proceedings of the 5th Workshop on Uncertainty Processing |
| page_num |
176-180 |
| editor |
|
|
| 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 |
| country |
CR |
| ARLID |
cav_un_auth*0012795 |
|
| project |
| project_id |
VS96008 |
| agency |
MŠk |
| country |
CZ |
| ARLID |
cav_un_auth*0025049 |
|
| research |
AV0Z1075907 |
| abstract
(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. |
| action |
| ARLID |
cav_un_auth*0212649 |
| name |
WUPES '2000. Workshop on Uncertainty Processing /5./ |
| place |
Jindřichův Hradec |
| country |
CZ |
| dates |
21.06.2000-24.06.2000 |
|
| RIV |
BA |
| department |
MTR |
| permalink |
http://hdl.handle.net/11104/0130442 |
| ID_orig |
UTIA-B 20000068 |
| arlyear |
2000 |
| mrcbU10 |
2000 |
| mrcbU10 |
Praha VŠE |
| mrcbU12 |
80-245-0048-5 |
| mrcbU63 |
Proceedings of the 5th Workshop on Uncertainty Processing 176 180 |
| mrcbU67 |
Vejnarová J. 340 |
|