Name
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 Godel, and Lukasiewicz 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. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1007/978-3-319-11113-1_9 | WEB REASONING AND RULE SYSTEMS, RR 2014 |
Field | DocType | Volume |
T-norm fuzzy logics,Data mining,Conjunctive query,Fuzzy classification,Computer science,Fuzzy set operations,Fuzzy logic,Fuzzy mathematics,Theoretical computer science,Fuzzy number,Type-2 fuzzy sets and systems | Conference | 8741 |
ISSN | Citations | PageRank |
0302-9743 | 4 | 0.39 |
References | Authors | |
21 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Theofilos P. Mailis | 1 | 90 | 6.26 |
| Rafael Peñaloza | 2 | 459 | 62.80 |
| Anni-Yasmin Turhan | 3 | 388 | 53.02 |