Conjunctive Query Answering in Finitely-valued Fuzzy Description Logics

Theofilos MailisTheofilos Mailis, Rafael PeñalozaRafael Peñaloza, Anni-Yasmin TurhanAnni-Yasmin Turhan

Download

Theofilos Mailis, Rafael Peñaloza, Anni-Yasmin Turhan
Conjunctive Query Answering in Finitely-valued Fuzzy Description Logics
In Roman Kontchakov and Marie-Laure Mugnier, eds., Proceedings of the 8th International Conference on Web Reasoning and Rule Systems (RR 2014), volume 8741, 124-139, 2014. Springer

Details
Bibtex

KurzfassungAbstract
Fuzzy Description Logics (DLs) generalize crisp ones by providing membership degree semantics for concepts and roles. A popular technique for reasoning in fuzzy DL ontologies is by providing a reduction to crisp DLs and then employ reasoning in the crisp DL. In this paper we adopt this approach to solve conjunctive query (CQ) answering problems for fuzzy DLs. We give reductions for Gödel and Łukasiewicz variants of fuzzy SROIQ and two kinds of fuzzy CQs. The correctness of the proposed reduction is proved and its complexity is studied for different fuzzy variants of SROIQ.
Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory

The final publication is available at Springer.

@inproceedings{ MaPe-RR-14,
  author = {Theofilos {Mailis} and Rafael {Pe\~naloza} and Anni-Yasmin {Turhan}},
  booktitle = {Proceedings of the 8th International Conference on Web Reasoning and Rule Systems (RR 2014)},
  editor = {Roman {Kontchakov} and Marie-Laure {Mugnier}},
  pages = {124--139},
  publisher = {Springer},
  title = {Conjunctive Query Answering in Finitely-valued Fuzzy Description Logics},
  volume = {8741},
  year = {2014},
}