<?xml version="1.0" encoding="utf-8"?>
<?xml-stylesheet type="text/xsl" href="style/detail_T.xsl"?>
<bibitem type="J">   <ARLID>0381759</ARLID> <utime>20240103201336.6</utime><mtime>20121030235959.9</mtime>   <WOS>000309879200005 </WOS>  <DOI>10.1007/s00500-012-0836-2</DOI>           <title language="eng" primary="1">Extension of belief functions to infinite-valued events</title>  <specification> <page_count>11 s.</page_count> </specification>   <serial><ARLID>cav_un_epca*0258368</ARLID><ISSN>1432-7643</ISSN><title>Soft Computing</title><part_num/><part_title/><volume_id>16</volume_id><volume>11 (2012)</volume><page_num>1851-1861</page_num><publisher><place/><name>Springer</name><year/></publisher></serial>    <keyword>belief function</keyword>   <keyword>MV-algebra</keyword>   <keyword>Moebius transform</keyword>    <author primary="1"> <ARLID>cav_un_auth*0101141</ARLID> <name1>Kroupa</name1> <name2>Tomáš</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/kroupa-extension of belief functions to infinite-valued events.pdf</url> </source>        <cas_special> <project> <project_id>1M0572</project_id> <agency>GA MŠk</agency> <ARLID>cav_un_auth*0001814</ARLID> </project> <project> <project_id>GA201/09/1891</project_id> <agency>GA ČR</agency> <ARLID>cav_un_auth*0253175</ARLID> </project>  <abstract language="eng" primary="1">We generalise belief functions to many-valued events which are represented by elements of Lindenbaum algebra of infinite-valued Łukasiewicz propositional logic. Our approach is based on mass assignments used in the Dempster–Shafer theory of evidence. A generalised belief function is totally monotone and it has Choquet integral representation with respect to a unique belief measure on Boolean events.</abstract>     <reportyear>2013</reportyear>  <RIV>BA</RIV>     <inst_support> RVO:67985556 </inst_support>  <permalink>http://hdl.handle.net/11104/0212155</permalink>          <unknown tag="mrcbT16-e">COMPUTERSCIENCEARTIFICIALINTELLIGENCE|COMPUTERSCIENCEINTERDISCIPLINARYAPPLICATIONS</unknown> <unknown tag="mrcbT16-f">1.364</unknown> <unknown tag="mrcbT16-g">0.193</unknown> <unknown tag="mrcbT16-h">4.6</unknown> <unknown tag="mrcbT16-i">0.00458</unknown> <unknown tag="mrcbT16-j">0.416</unknown> <unknown tag="mrcbT16-k">1380</unknown> <unknown tag="mrcbT16-l">161</unknown> <unknown tag="mrcbT16-s">0.747</unknown> <unknown tag="mrcbT16-4">Q1</unknown> <unknown tag="mrcbT16-B">18.633</unknown> <unknown tag="mrcbT16-C">41.576</unknown> <unknown tag="mrcbT16-D">Q4</unknown> <unknown tag="mrcbT16-E">Q2</unknown> <arlyear>2012</arlyear>       <unknown tag="mrcbU34"> 000309879200005  WOS </unknown> <unknown tag="mrcbU63"> cav_un_epca*0258368 Soft Computing 1432-7643 1433-7479 Roč. 16 č. 11 2012 1851 1861 Springer </unknown> </cas_special> </bibitem>