<?xml version="1.0" encoding="utf-8"?>
<?xml-stylesheet type="text/xsl" href="style/detail_T.xsl"?>
<bibitem type="J">   <ARLID>0410371</ARLID> <utime>20240103182209.2</utime><mtime>20060210235959.9</mtime>        <title language="eng" primary="1">Representation of irrelevance relations by annotated graphs</title>  <specification> <page_count>51 s.</page_count> </specification>   <serial><ARLID>cav_un_epca*0258140</ARLID><ISSN>0169-2968</ISSN><title>Fundamenta Informaticae</title><part_num/><part_title/><volume_id>42</volume_id><volume>1 (2000)</volume><page_num>149-199</page_num><publisher><place/><name>IOS Press</name><year/></publisher></serial>   <author primary="1"> <ARLID>cav_un_auth*0212661</ARLID> <name1>Paz</name1> <name2>A.</name2> <country>IL</country>  </author> <author primary="0"> <ARLID>cav_un_auth*0212662</ARLID> <name1>Geva</name1> <name2>R. Y.</name2> <country>US</country>  </author> <author primary="0"> <ARLID>cav_un_auth*0101202</ARLID> <name1>Studený</name1> <name2>Milan</name2> <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>     <COSATI>12A</COSATI>    <cas_special> <project> <project_id>IAA1075801</project_id> <agency>GA AV</agency> <country>CZ</country> <ARLID>cav_un_auth*0012795</ARLID> </project> <project> <project_id>VS96008</project_id> <agency>MŠMT</agency> <country>CZ</country> <ARLID>cav_un_auth*0025049</ARLID> </project> <research> <research_id>AV0Z1075907</research_id> </research>  <abstract language="eng" primary="1">Irrelevance relations are sets of statements of the form: given value of Z values of Y can add no information about values of X. Various graphs were used as schemes for representing irrelevance relations. Annotated graphs are defined and proposed as a new model of graphical representation of irrelevance relations. The new model generalizes properly former graphical models. Any relation represented by undirected graph, acyclic directed graph or chain graph can be represented by an annotated graph.</abstract>      <RIV>BA</RIV>      <department>MTR</department>   <permalink>http://hdl.handle.net/11104/0130460</permalink>   <ID_orig>UTIA-B 20000087</ID_orig>      <arlyear>2000</arlyear>       <unknown tag="mrcbU63"> cav_un_epca*0258140 Fundamenta Informaticae 0169-2968 1875-8681 Roč. 42 č. 1 2000 149 199 IOS Press </unknown> </cas_special> </bibitem>