Publication Date:
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.
Iris type:
04.01 Contributo in Atti di convegno
Keywords:
I.2.4 Knowledge Representation Formalisms and Methods
List of contributors: