Charles Explorer logo
🇬🇧

A description Logic with Concept Ordering and top-k Restriction

Publication at Faculty of Mathematics and Physics |
2008

Abstract

In this paper we introduce a new ?scoring? description logic s-ELtop-k with concept instance ordering and top-k restriction queries. This enables to create ontologies describing user preferences (ordering of concept instances) and to describe concepts consisting of top-k instances according to this ordering.

We construct algorithm for instance problem in s-ELtop-k. The main application is an extension of web modeling languages to model user preferences and top-k in web services and web search.