Top−k Retrieval in Description Logic Programs Under Vagueness for the Semantic Web
Thomas Lukasiewicz and Umberto Straccia
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.
Book Title
Proceedings of the 1st International Conference on Scalable Uncertainty Management‚ SUM 2007‚ Washington‚ DC‚ USA‚ October 10−12‚ 2007
Editor
Henri Prade and V. S. Subrahmanian
ISBN
978−3−540−75407−7
Pages
16−30
Publisher
Springer
Series
Lecture Notes in Computer Science
Volume
4772
Year
2007