%0 Journal Article %1 BaaderBorgwardtPenaloza17ki %A Baader, Franz %A Borgwardt, Stefan %A Peñaloza, Rafael %D 2017 %J KI -- Künstliche Intelligenz %K 01624 springer paper ai numerical knowledge processing ontology logic fuzzy %N 1 %P 85--90 %R 10.1007/s13218-016-0459-3 %T Decidability and Complexity of Fuzzy Description Logics %V 31 %X 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.

@article{BaaderBorgwardtPenaloza17ki, abstract = {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.}, added-at = {2017-04-17T13:48:51.000+0200}, author = {Baader, Franz and Borgwardt, Stefan and Pe{\~n}aloza, Rafael}, biburl = {https://www.bibsonomy.org/bibtex/22655e3d6070c96c78d8f66ece256f983/flint63}, doi = {10.1007/s13218-016-0459-3}, file = {SpringerLink:2017/BaaderBorgwardtPenaloza17ki.pdf:PDF}, groups = {public}, interhash = {e506ce7b48b8ac92d1200f49bc63bf08}, intrahash = {2655e3d6070c96c78d8f66ece256f983}, issn = {0933-1875}, journal = {KI -- K\"{u}nstliche Intelligenz}, keywords = {01624 springer paper ai numerical knowledge processing ontology logic fuzzy}, month = {#mar#}, number = 1, pages = {85--90}, timestamp = {2017-07-13T18:07:39.000+0200}, title = {Decidability and Complexity of Fuzzy Description Logics}, username = {flint63}, volume = 31, year = 2017 }