关于互[0,1]值关系的传递闭包

EUSFLAT Conf. Pub Date : 2011-08-06 DOI:10.2991/eusflat.2011.113

Steven Freson, H. Meyer, B. Baets

{"title":"关于互[0,1]值关系的传递闭包","authors":"Steven Freson, H. Meyer, B. Baets","doi":"10.2991/eusflat.2011.113","DOIUrl":null,"url":null,"abstract":"We build a theoretical framework that enables to extend the concept of transitive closure to the class of complete crisp relations, the class of reciprocal 3-valued relations and the class of reciprocal [0, 1]valued relations. We present algorithms to compute the transitive closure of reciprocal [0, 1]-valued relations, where the type of transitivity is either weak stochastic transitivity or strong stochastic transitivity.","PeriodicalId":403191,"journal":{"name":"EUSFLAT Conf.","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"On the transitive closure of reciprocal [0, 1]-valued relations\",\"authors\":\"Steven Freson, H. Meyer, B. Baets\",\"doi\":\"10.2991/eusflat.2011.113\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We build a theoretical framework that enables to extend the concept of transitive closure to the class of complete crisp relations, the class of reciprocal 3-valued relations and the class of reciprocal [0, 1]valued relations. We present algorithms to compute the transitive closure of reciprocal [0, 1]-valued relations, where the type of transitivity is either weak stochastic transitivity or strong stochastic transitivity.\",\"PeriodicalId\":403191,\"journal\":{\"name\":\"EUSFLAT Conf.\",\"volume\":\"16 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-08-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"EUSFLAT Conf.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.2991/eusflat.2011.113\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"EUSFLAT Conf.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2991/eusflat.2011.113","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

我们建立了一个理论框架，将传递闭包的概念推广到完全清晰关系类、互反3值关系类和互反[0,1]值关系类。给出了可传递性类型为弱随机可传递性或强随机可传递性的倒[0,1]值关系的可传递闭包的计算算法。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

On the transitive closure of reciprocal [0, 1]-valued relations

We build a theoretical framework that enables to extend the concept of transitive closure to the class of complete crisp relations, the class of reciprocal 3-valued relations and the class of reciprocal [0, 1]valued relations. We present algorithms to compute the transitive closure of reciprocal [0, 1]-valued relations, where the type of transitivity is either weak stochastic transitivity or strong stochastic transitivity.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

EUSFLAT Conf.

自引率

0.00%

发文量