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

Thomas Lukasiewicz; 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.

Actions

Email

Email this record

Send the bibliographic details of this record to your email address.

Your Email
Please enter the email address that the record information will be sent to.

-
Your message (optional)
Please add any additional information to be included within the email.
Cite

Cite this record

APA Style

Lukasiewicz, T., & Straccia, U. (2007). Top−k Retrieval in Description Logic Programs Under Vagueness for the Semantic Web. 4772.

MLA Style

Lukasiewicz, Thomas, and Umberto Straccia. Top−k Retrieval in Description Logic Programs Under Vagueness for the Semantic Web. Springer, 2007.

Chicago Style

Lukasiewicz, Thomas, and Umberto Straccia. 2007. “Top−k Retrieval in Description Logic Programs Under Vagueness for the Semantic Web.” In . Vol. 4772. Springer.
Tweet
Print