.png){kind=icon}
返回
Computing crisp bisimulations for fuzzy structures
.png){kind=icon}
OA
AI
DOI：10.1016/j.ijar.2024.109121.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We present an efficient algorithm for computing the partition corresponding to the greatest crisp bisimulation of a given finite fuzzy labeled graph. Its complexity is of order O((m log 1 + n) log n), where n, m and 1 are the number of vertices, the number of nonzero edges and the number of different fuzzy degrees of edges of the input graph, respectively. We also study a similar problem for the setting with counting successors, which corresponds to the case with qualified number restrictions in description logics and graded modalities in modal logics. In particular, we provide an efficient algorithm with the complexity O((m log m + n) log n) for the considered problem in that setting.
Keyword:
Bisimulation
Fuzzy automata
Fuzzy description logics
Fuzzy transition systems
Weighted social networks
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3
论文数:
3.0K
被引数:
5.1K
机构
引用论文
Monitoring of Carriageway Cross Section Profiles on Forest Roads: Assessment of an Ultrasound Data Based Road Scanner with TLS Data Reference.png)
Forests
OAAI
ForestsIF0
OAAI分享收藏Anthropogenic activities affecting metal transfer and health risk in plastic-shed soil-vegetable-human system via changing soil pH and metal contentsChemosphere
ChemosphereIF0
PREAI
分享收藏
查看更多内容