Answering Vague Queries in Fuzzy DL-LITE
Proceedings of the 11th International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems, (IPMU-06).
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 DL-LITE. We show how to compute efficiently the top-k answers of a complex query (i.e.~conjunctive queries) over a huge set of instances.