Fuzzy Description Logics (fuzzy DLs) allow to describe structured knowledge with vague concepts. Unlike classical DLs, in fuzzy DLs an answer is a set of tuples ranked according to the degree they satisfy the query. In this paper, we consider fuzzy DL-Lite. We show how to compute efficiently the top-$k$ answers of a complex query (ie~conjunctive queries) over a huge set of instances.
Answering vague queries in fuzzy DL-LITE
Straccia U
2006
Abstract
Fuzzy Description Logics (fuzzy DLs) allow to describe structured knowledge with vague concepts. Unlike classical DLs, in fuzzy DLs an answer is a set of tuples ranked according to the degree they satisfy the query. In this paper, we consider fuzzy DL-Lite. We show how to compute efficiently the top-$k$ answers of a complex query (ie~conjunctive queries) over a huge set of instances.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
prod_91304-doc_128282.pdf
solo utenti autorizzati
Descrizione: Answering vague queries in fuzzy DL-LITE
Tipologia:
Versione Editoriale (PDF)
Dimensione
238.88 kB
Formato
Adobe PDF
|
238.88 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.
