<?xml version="1.0" encoding="utf-8"?>
<?xml-stylesheet type="text/xsl" href="style/detail_T.xsl"?>
<bibitem type="J">   <ARLID>0490791</ARLID> <utime>20240103220201.4</utime><mtime>20180629235959.9</mtime>   <SCOPUS>85047063158</SCOPUS> <WOS>000437074500005</WOS>  <DOI>10.1016/j.tcs.2018.05.010</DOI>           <title language="eng" primary="1">Fraisse classes of graded relational structures</title>  <specification> <page_count>10 s.</page_count> <media_type>P</media_type> </specification>   <serial><ARLID>cav_un_epca*0257658</ARLID><ISSN>0304-3975</ISSN><title>Theoretical Computer Science</title><part_num/><part_title/><volume_id>737</volume_id><volume>1 (2018)</volume><page_num>81-90</page_num><publisher><place/><name>Elsevier</name><year/></publisher></serial>    <keyword>Mathematical fuzzy logic</keyword>   <keyword>Fuzzy structure</keyword>   <keyword>Fraïssé limit</keyword>   <keyword>Fuzzy order</keyword>   <keyword>Weighted graphs</keyword>   <keyword>Graded model theory</keyword>    <author primary="1"> <ARLID>cav_un_auth*0362070</ARLID> <name1>Badia</name1> <name2>G.</name2> <country>AT</country> </author> <author primary="0"> <ARLID>cav_un_auth*0293476</ARLID> <full_dept language="cz">Matematická teorie rozhodování</full_dept> <full_dept>Department of Decision Making Theory</full_dept> <department language="cz">MTR</department> <department>MTR</department> <full_dept>Department of Decision Making Theory</full_dept>  <name1>Noguera</name1> <name2>Carles</name2> <institution>UTIA-B</institution> <garant>K</garant> <fullinstit>Ústav teorie informace a automatizace AV ČR, v. v. i.</fullinstit> </author>   <source> <url>http://library.utia.cas.cz/separaty/2018/MTR/noguera-0490791.pdf</url> </source>        <cas_special> <project> <ARLID>cav_un_auth*0349495</ARLID> <project_id>GA17-04630S</project_id> <agency>GA ČR</agency> </project>  <abstract language="eng" primary="1">We study classes of graded structures satisfying the properties of amalgamation, joint embedding and hereditariness. Given appropriate conditions, we can build a graded analogue of the Fraïssé limit. Some examples such as the class of all finite weighted graphs or the class of all finite fuzzy orders (evaluated on a particular countable algebra) will be examined.</abstract>     <result_subspec>WOS</result_subspec> <RIV>BA</RIV> <FORD0>10000</FORD0> <FORD1>10100</FORD1> <FORD2>10102</FORD2>    <reportyear>2019</reportyear>      <num_of_auth>2</num_of_auth>  <inst_support> RVO:67985556 </inst_support>  <permalink>http://hdl.handle.net/11104/0285274</permalink>   <confidential>S</confidential>  <unknown tag="mrcbC86"> 3+4 Article Computer Science Theory Methods </unknown>         <unknown tag="mrcbT16-e">COMPUTERSCIENCE.THEORY&amp;METHODS</unknown> <unknown tag="mrcbT16-f">0.791</unknown> <unknown tag="mrcbT16-g">0.157</unknown> <unknown tag="mrcbT16-h">8</unknown> <unknown tag="mrcbT16-i">0.01186</unknown> <unknown tag="mrcbT16-j">0.42</unknown> <unknown tag="mrcbT16-k">7926</unknown> <unknown tag="mrcbT16-s">0.494</unknown> <unknown tag="mrcbT16-5">0.640</unknown> <unknown tag="mrcbT16-6">332</unknown> <unknown tag="mrcbT16-7">Q4</unknown> <unknown tag="mrcbT16-B">39.031</unknown> <unknown tag="mrcbT16-C">16.7</unknown> <unknown tag="mrcbT16-D">Q3</unknown> <unknown tag="mrcbT16-E">Q2</unknown> <unknown tag="mrcbT16-M">0.4</unknown> <unknown tag="mrcbT16-N">Q3</unknown> <unknown tag="mrcbT16-P">16.667</unknown> <arlyear>2018</arlyear>       <unknown tag="mrcbU14"> 85047063158 SCOPUS </unknown> <unknown tag="mrcbU24"> PUBMED </unknown> <unknown tag="mrcbU34"> 000437074500005 WOS </unknown> <unknown tag="mrcbU63"> cav_un_epca*0257658 Theoretical Computer Science 0304-3975 1879-2294 Roč. 737 č. 1 2018 81 90 Elsevier </unknown> </cas_special> </bibitem>