Top-k Retrieval in Description Logic Programs Under Vagueness for the Semantic Web

  • Authors:
  • Thomas Lukasiewicz;Umberto Straccia

  • Affiliations:
  • DIS, Sapienza Università di Roma, Via Ariosto 25, I-00185 Roma, Italy and Institut für Informationssysteme, Technische Universität Wien, Favoritenstraße 9-11, A-1040 Wien, Aust ...;ISTI-CNR, Via G. Moruzzi 1, I-56124 Pisa, Italy

  • Venue:
  • SUM '07 Proceedings of the 1st international conference on Scalable Uncertainty Management
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Description logics (DLs) and logic programs (LPs) are important representation languages for the Semantic Web. In this paper, we address an emerging problem in such languages, namely, the problem of evaluating ranked top-k queries. Specifically, we show how to compute the top-k answers in a data-complexity tractable combination of DLs and LPs under vagueness.