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 .
Mailis, T., Penaloza, R., Turhan, A. (2014). Conjunctive Query Answering in Finitely-valued Fuzzy Description Logics. In Web Reasoning and Rule Systems: 8th International Conference, RR 2014, Athens, Greece, September 15-17, 2014. Proceedings (pp.124-139). Springer [10.1007/978-3-319-11113-1_9].
Conjunctive Query Answering in Finitely-valued Fuzzy Description Logics
Penaloza, R;
2014
Abstract
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 .File | Dimensione | Formato | |
---|---|---|---|
MaPe-RR-14.pdf
accesso aperto
Tipologia di allegato:
Submitted Version (Pre-print)
Dimensione
790.52 kB
Formato
Adobe PDF
|
790.52 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.