.png){kind=icon}
.png){kind=icon}
Return
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}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Bisimulation
Fuzzy automata
Fuzzy description logics
Fuzzy transition systems
Weighted social networks
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3
Papers:
2.9K
Citations:
5.1K