A prominent problem in knowledge representation is how to answer queries taking into accountalso the implicit consequences of an ontology representing domain knowledge. While this problemhas been widely studied within the realm of description logic ontologies, it has been surprisinglyneglected within the context of vague or imprecise knowledge, particularly from the point ofview of mathematical fuzzy logic. In this paper, we study the problem of answering conjunctivequeries and threshold queries w.r.t. ontologies in fuzzy DL-Lite. Specifically, we show through arewriting approach that threshold query answering w.r.t. consistent ontologies remains in AC0in data complexity, but that conjunctive query answering is highly dependent on the selectedtriangular norm, which has an impact on the underlying semantics. For the idempotent G¨odelt-norm, we provide an effective method based on a reduction to the classical case.
展开▼
