Conjunctive Query Answering in Finitely-Valued Fuzzy Description Logics

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 s...

Full description

Saved in:
Bibliographic Details
Published inLecture notes in computer science pp. 124 - 139
Main Authors Mailis, Theofilos, Peñaloza, Rafael, Turhan, Anni-Yasmin
Format Book Chapter
LanguageEnglish
Published Cham Springer International Publishing 2014
SeriesLecture Notes in Computer Science
Online AccessGet full text
ISBN9783319111124
3319111124
ISSN0302-9743
1611-3349
1611-3349
DOI10.1007/978-3-319-11113-1_9

Cover

More Information
Summary: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 Gödel, and Łukasiewicz variants of fuzzy and two kinds of fuzzy CQs. The correctness of the proposed reduction is proved and its complexity is studied for different fuzzy variants of .
Bibliography:Partially supported by DFG SFB 912 (HAEC) and the Cluster of Excellence ‘cfAED’.
ISBN:9783319111124
3319111124
ISSN:0302-9743
1611-3349
1611-3349
DOI:10.1007/978-3-319-11113-1_9