Top-K Retrieval in Description Logic Programs under Vagueness for the Semantic Web

In 1st International Conference on Scalable Uncertainty Management (SUM-07).


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.