The Complexity of Subsumption in Fuzzy EL

Stefan BorgwardtStefan Borgwardt, Marco CeramiMarco Cerami, Rafael PeñalozaRafael Peñaloza

Download

Stefan Borgwardt, Marco Cerami, Rafael Peñaloza
The Complexity of Subsumption in Fuzzy EL
In Qiang Yang, Michael Wooldridge, eds., Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI'15), 2812–2818, 2015. AAAI Press

Details
Bibtex

KurzfassungAbstract
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.
Bemerkung: Note: © IJCAI
Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory

@inproceedings{BCP2015,
  author    = {Stefan Borgwardt and Marco Cerami and Rafael Pe{\~{n}}aloza},
  title     = {The Complexity of Subsumption in Fuzzy {EL}},
  editor    = {Qiang Yang and Michael Wooldridge},
  booktitle = {Proceedings of the 24th International Joint Conference on
               Artificial Intelligence (IJCAI'15)},
  publisher = {AAAI Press},
  year      = {2015},
  pages     = {2812{\textendash}2818}
}