<?xml version="1.0" encoding="utf-8"?>
<?xml-stylesheet type="text/xsl" href="style/detail_T.xsl"?>
<bibitem type="M">   <ARLID>0410229</ARLID> <utime>20240103182159.6</utime><mtime>20060210235959.9</mtime>    <ISBN>3-7908-1217-X</ISBN>         <title language="eng" primary="1">Evaluating linguistic expressions and functional fuzzy theories in fuzzy logic</title>  <publisher> <place>Heidelberg</place> <name>PhysicaVerlag</name> <pub_time>1999</pub_time> </publisher> <specification> <page_count>24 s.</page_count> </specification> <edition> <name>Studies in Fuzziness and Soft Computing.</name> <volume_id>33</volume_id> </edition>   <serial><title>Computing with Words in Information/Intelligent Systems 1. Foundations</title><part_num/><part_title/><page_num>383-406</page_num><editor><name1>Zadeh</name1><name2>L. A.</name2></editor><editor><name1>Kacprzyk</name1><name2>J.</name2></editor></serial>   <author primary="1"> <ARLID>cav_un_auth*0101170</ARLID> <name1>Novák</name1> <name2>Vilém</name2> <institution>UTIA-B</institution>  <fullinstit>Ústav teorie informace a automatizace AV ČR, v. v. i.</fullinstit> </author> <author primary="0"> <ARLID>cav_un_auth*0212311</ARLID> <name1>Perfilieva</name1> <name2>I.</name2> <country>RU</country>  </author>     <COSATI>120</COSATI>    <cas_special> <project> <project_id>GA201/96/0985</project_id> <agency>GA ČR</agency> <ARLID>cav_un_auth*0005875</ARLID> </project> <research> <research_id>AV0Z1075907</research_id> </research>     <RIV>BA</RIV>   <department>E</department>    <permalink>http://hdl.handle.net/11104/0130320</permalink>   <ID_orig>UTIA-B 990213</ID_orig>     <arlyear>1999</arlyear>       <unknown tag="mrcbU10"> 1999 </unknown> <unknown tag="mrcbU10"> Heidelberg PhysicaVerlag </unknown> <unknown tag="mrcbU12"> 3-7908-1217-X </unknown> <unknown tag="mrcbU63"> Computing with Words in Information/Intelligent Systems 1. Foundations 383 406 </unknown> <unknown tag="mrcbU67"> Zadeh L. A. 340 </unknown> <unknown tag="mrcbU67"> Kacprzyk J. 340 </unknown> </cas_special> </bibitem>