Publication at Faculty of Mathematics and Physics |
2010
Abstract
User preference is often a source of uncertainty in web search. We propose an order-oriented description logic suited especially to represent user preference.
Concepts are interpreted as preorders of individuals from the domain. We redefine reasoning tasks to reflect order-oriented approach and we present an algorithm for order instance problem in description logic without aggregation.
Furthermore, we describe top-k retrieval which allows us to find the bes objects with respect to user preference concepts.