Deciding Query Entailment in Fuzzy Description Logic Knowledge Bases

  • Authors:
  • Jingwei Cheng;Z. M. Ma;Fu Zhang;Xing Wang

  • Affiliations:
  • Northeastern University, Shenyang, China 110004;Northeastern University, Shenyang, China 110004;Northeastern University, Shenyang, China 110004;Northeastern University, Shenyang, China 110004

  • Venue:
  • DEXA '09 Proceedings of the 20th International Conference on Database and Expert Systems Applications
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Existing fuzzy description logic (DL) reasoners either are not capable of answering conjunctive queries, or only apply to DLs with less expressivity. In this paper, we present an algorithm for answering expressive fuzzy conjunctive queries, which allows the occurrence of both lower bound and the upper bound of thresholds in a query atom, over the relative expressive DL, namely fuzzy $\mathcal{ALCN}$. Our algorithm is specially tailored for deciding conjunctive query entailment of negative role atoms in the form of R (x ,y ) ≤ n or R (x ,y ) n which, to the best of our knowledge, has not been touched on in other literatures.