Answering Vague Queries in Fuzzy DL-Lite
Umberto Straccia · 2006
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 e#ciently the top-k answers of a complex query (i.e. conjunctive queries) over a huge set of instances.