Answering Fuzzy Conjunctive Queries over Finitely Valued Fuzzy Ontologies
This work addresses querying vague knowledge in fuzzy description logics, representing an incremental improvement in computational efficiency for a specialized domain.
The paper tackles the problem of answering fuzzy conjunctive queries over finitely valued fuzzy ontologies by extending a reduction technique to classical description logics, resulting in improved complexity bounds and experimental validation of feasibility.
Fuzzy Description Logics (DLs) provide a means for representing vague knowledge about an application domain. In this paper, we study fuzzy extensions of conjunctive queries (CQs) over the DL $\mathcal{SROIQ}$ based on finite chains of degrees of truth. To answer such queries, we extend a well-known technique that reduces the fuzzy ontology to a classical one, and use classical DL reasoners as a black box. We improve the complexity of previous reduction techniques for finitely valued fuzzy DLs, which allows us to prove tight complexity results for answering certain kinds of fuzzy CQs. We conclude with an experimental evaluation of a prototype implementation, showing the feasibility of our approach.