Decidability and Complexity of Fuzzy Description Logics

Franz BaaderFranz Baader, Stefan BorgwardtStefan Borgwardt, Rafael PeñalozaRafael Peñaloza

Franz Baader, Stefan Borgwardt, Rafael Peñaloza
Decidability and Complexity of Fuzzy Description Logics
Künstliche Intelligenz, 31(1):85–90, 2017

Details
Bibtex

KurzfassungAbstract
Fuzzy description logics (FDLs) have been introduced to represent concepts for which membership cannot be determined in a precise way, i.e., where instead of providing a strict border between being a member and not being a member, it is more appropriate to model a gradual change from membership to non-membership. First approaches for reasoning in FDLs where based either on a reduction to reasoning in classical description logics (DLs) or on adaptations of reasoning approaches for DLs to the fuzzy case. However, it turned out that these approaches in general do not work if expressive terminological axioms, called general concept inclusions (GCIs), are available in the FDL. The goal of this project was a comprehensive study of the border between decidability and undecidability for FDLs with GCIs, as well as determining the exact complexity of the decidable logics. As a result, we have provided an almost complete classification of the decidability and complexity of FDLs with GCIs.
Bemerkung: Note: Project report.
Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory

@article{BBP2017,
  author  = {Franz Baader and Stefan Borgwardt and Rafael Pe{\~{n}}aloza},
  title   = {Decidability and Complexity of Fuzzy Description Logics},
  journal = {K{\"{u}}nstliche Intelligenz},
  volume  = {31},
  number  = {1},
  year    = {2017},
  pages   = {85{\textendash}90},
  doi     = {10.1007/s13218-016-0459-3}
}