<?xml version="1.0" encoding="utf-8"?>
<?xml-stylesheet type="text/xsl" href="style/detail_T.xsl"?>
<bibitem type="J">   <ARLID>0382050</ARLID> <utime>20240103201356.3</utime><mtime>20121029235959.9</mtime>   <WOS>000309624800006</WOS>  <DOI>10.1016/j.ijar.2012.06.012</DOI>           <title language="eng" primary="1">Local computations in Dempster-Shafer theory of evidence</title>  <specification> <page_count>13 s.</page_count> </specification>   <serial><ARLID>cav_un_epca*0256774</ARLID><ISSN>0888-613X</ISSN><title>International Journal of Approximate Reasoning</title><part_num/><part_title/><volume_id>53</volume_id><volume>8 (2012)</volume><page_num>1155-1167</page_num><publisher><place/><name>Elsevier</name><year/></publisher></serial>    <keyword>Discrete belief functions</keyword>   <keyword>Dempster-Shafer theory</keyword>   <keyword>conditional independence</keyword>   <keyword>decomposable model</keyword>    <author primary="1"> <ARLID>cav_un_auth*0101118</ARLID> <name1>Jiroušek</name1> <name2>Radim</name2> <full_dept language="cz">Matematická teorie rozhodování</full_dept> <full_dept language="eng">Department of Decision Making Theory</full_dept> <department language="cz">MTR</department> <department language="eng">MTR</department> <institution>UTIA-B</institution> <full_dept>Department of Decision Making Theory</full_dept>  <fullinstit>Ústav teorie informace a automatizace AV ČR, v. v. i.</fullinstit> </author>   <source> <url>http://library.utia.cas.cz/separaty/2012/MTR/jirousek-local computations in dempster–shafer theory of evidence.pdf</url> </source>        <cas_special> <project> <project_id>GAP403/12/2175</project_id> <agency>GA ČR</agency> <country>CZ</country> <ARLID>cav_un_auth*0284585</ARLID> </project>  <abstract language="eng" primary="1">The paper studies a possibility of transferring ideas of local computations introduced in probability by Lauritzen and Spiegelhalter into Dempster–Shafer theory of evidence. The paper recalls decomposable models, discusses connection of the model structure with the corresponding system of conditional independence relations, and shows that under special additional conditions, one can locally compute specific basic assignments which can be considered to be conditional.</abstract>     <reportyear>2013</reportyear>  <RIV>IN</RIV>      <num_of_auth>1</num_of_auth>  <inst_support> RVO:67985556 </inst_support>  <permalink>http://hdl.handle.net/11104/0212388</permalink>          <unknown tag="mrcbT16-e">COMPUTERSCIENCEARTIFICIALINTELLIGENCE</unknown> <unknown tag="mrcbT16-f">2.165</unknown> <unknown tag="mrcbT16-g">0.447</unknown> <unknown tag="mrcbT16-h">5.5</unknown> <unknown tag="mrcbT16-i">0.00618</unknown> <unknown tag="mrcbT16-j">0.745</unknown> <unknown tag="mrcbT16-k">1920</unknown> <unknown tag="mrcbT16-l">85</unknown> <unknown tag="mrcbT16-s">1.494</unknown> <unknown tag="mrcbT16-4">Q1</unknown> <unknown tag="mrcbT16-B">65.146</unknown> <unknown tag="mrcbT16-C">70.000</unknown> <unknown tag="mrcbT16-D">Q2</unknown> <unknown tag="mrcbT16-E">Q1</unknown> <arlyear>2012</arlyear>       <unknown tag="mrcbU34"> 000309624800006 WOS </unknown> <unknown tag="mrcbU63"> cav_un_epca*0256774 International Journal of Approximate Reasoning 0888-613X 1873-4731 Roč. 53 č. 8 2012 1155 1167 Elsevier </unknown> </cas_special> </bibitem>