Subsumption in Finitely Valued Fuzzy EL

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

Download

Stefan Borgwardt, Marco Cerami, Rafael Peñaloza
Subsumption in Finitely Valued Fuzzy EL
Technical Report, Chair for Automata Theory, Institute for Theoretical Computer Science, Technische Universität Dresden, volume 15-06, 2015. LTCS-Report

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.
Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory

@techreport{BCP2015,
  author      = {Stefan Borgwardt and Marco Cerami and Rafael Pe{\~{n}}aloza},
  title       = {Subsumption in Finitely Valued Fuzzy {EL}},
  institution = {Chair for Automata Theory, Institute for Theoretical Computer
                 Science, Technische Universit{\"{a}}t Dresden},
  year        = {2015}
}