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.
Top-K retrieval in description logic programs under vagueness for the semantic Web
Straccia U
2007
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.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
prod_44024-doc_131673.pdf
solo utenti autorizzati
Descrizione: Top-K retrieval in description logic programs under vagueness for the semantic Web
Tipologia:
Versione Editoriale (PDF)
Dimensione
526.89 kB
Formato
Adobe PDF
|
526.89 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
