<?xml version="1.0" encoding="utf-8"?>
<?xml-stylesheet type="text/xsl" href="style/detail_T.xsl"?>
<bibitem type="C">   <ARLID>0409400</ARLID> <utime>20240103182105.6</utime><mtime>20060210235959.9</mtime>    <ISBN>1-55860-412-X</ISBN>         <title language="eng" primary="1">On separation criterion and recovery algorithm for chain graphs</title>  <publisher> <place>San Francisco</place> <name>Morgan Kaufmann Publ.</name> <pub_time>1996</pub_time> </publisher>   <serial><title>Uncertainty in Artificial Intelligence. Proceedings</title><part_num/><part_title/><page_num>509-516</page_num><editor><name1>Horvik</name1><name2>E.</name2></editor><editor><name1>Jensen</name1><name2>F.</name2></editor></serial>   <author primary="1"> <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>201/94/0471</project_id> <agency>GA ČR</agency> <ARLID>cav_un_auth*0212109</ARLID> </project> <project> <project_id>Copernicus CT 93:0053</project_id> <agency>Commission EC</agency> <country>XE</country> </project> <action target=""> <ARLID>cav_un_auth*0212209</ARLID> <name>Conference on Uncertainty in Artificial Intelligence /12./</name> <place>Portland</place> <country>US</country> <dates>01.08.1996-04.08.1996</dates> </action>      <department>MTR</department>    <permalink>http://hdl.handle.net/11104/0129497</permalink>   <ID_orig>UTIA-B 960149</ID_orig>     <arlyear>1996</arlyear>       <unknown tag="mrcbU10"> 1996 </unknown> <unknown tag="mrcbU10"> San Francisco Morgan Kaufmann Publ. </unknown> <unknown tag="mrcbU12"> 1-55860-412-X </unknown> <unknown tag="mrcbU63"> Uncertainty in Artificial Intelligence. Proceedings 509 516 </unknown> <unknown tag="mrcbU67"> Horvik E. 340 </unknown> <unknown tag="mrcbU67"> Jensen F. 340 </unknown> </cas_special> </bibitem>