返回
Parallel Algorithms for Fuzzy Ontology Reasoning
DOI:10.1109/TFUZZ.2012.2230266.png)
摘要
En 中文
The need to deal with imprecise and vague information in ontologies is rising in importance, as required by several real-world application domains. As a consequence, there is a growing interest in fuzzy ontologies, which combine ontologies and fuzzy logic theory. In fuzzy ontologies, some reasoning tasks usually become harder to solve, such as the concept subsumption problem and the computation of the Best Degree Bound (BDB) of an axiom. In fact, the current existing algorithms to solve these problems usually require performing some simpler tests several times. In this paper, we present a parallelization of these algorithms, implemented in the DeLorean reasoner, and discuss the encouraging results of an empirical evaluation.
Keyword:
Fuzzy description logics (DLs)
fuzzy ontologies
logic for the semantic web
parallel algorithms
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
11.9
论文数:
5.0K
被引数:
2.9W

