Towards top-k query answering in description logics: the case of DL-Lite

  • Authors:
  • Umberto Straccia

  • Affiliations:
  • ISTI – CNR, Pisa, Italy

  • Venue:
  • JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

We address the problem of evaluating ranked top-k queries in description logics. The problem occurs whenever we allow queries such as “find cheap hotels close to the conference location” in which fuzzy predicates like cheap and close occur. We show how to efficiently compute the top-k answers of conjunctive queries with fuzzy predicates over DL-LITE like knowledge bases.