The Complexity of Subsumption in Fuzzy EL
Abstract
Fuzzy Description Logics (DLs) are used to represent and reason about vague and imprecise knowledge that is inherent to many application domains. It was recently shown that the complexity of reasoning in finitely valued fuzzy DLs is often not higher than that of the underlying classical DL. We show that this does not hold for fuzzy extensions of the light-weight DL EL, which is used in many biomedical ontologies, under the Lukasiewicz semantics. The complexity of reasoning increases from PTime to ExpTime, even if only one additional truth value is introduced. The same lower bound holds also for infinitely valued Lukasiewicz extensions of EL.
Cite
Text
Borgwardt et al. "The Complexity of Subsumption in Fuzzy EL." International Joint Conference on Artificial Intelligence, 2015.Markdown
[Borgwardt et al. "The Complexity of Subsumption in Fuzzy EL." International Joint Conference on Artificial Intelligence, 2015.](https://mlanthology.org/ijcai/2015/borgwardt2015ijcai-complexity/)BibTeX
@inproceedings{borgwardt2015ijcai-complexity,
title = {{The Complexity of Subsumption in Fuzzy EL}},
author = {Borgwardt, Stefan and Cerami, Marco and Peñaloza, Rafael},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2015},
pages = {2812-2818},
url = {https://mlanthology.org/ijcai/2015/borgwardt2015ijcai-complexity/}
}