Group Preferences for Query Answering in Datalog+⁄− Ontologies
Thomas Lukasiewicz‚ Maria Vanina Martinez‚ Gerardo I. Simari and Oana Tifrea−Marciuska
In the recent years, the Web has been changing more and more towards the so-called Social Semantic Web. Rather than being based on the link structure between Web pages, the ranking of search results in the Social Semantic Web needs to be based on something new. We believe that it can be based on ontological background knowledge and on user preferences. In this paper, we thus propose an extension of the Datalog+⁄− ontology language that allows for dealing with partially ordered preferences of groups of users. We focus on answering k-rank queries in this context. In detail, we present different strategies to compute group preferences as an aggregation of the preferences of a collection of single users. We then provide algorithms to answer k-rank queries for DAQs (disjunctions of atomic queries) under these group preferences. We show that such DAQ answering in Datalog+⁄− can be done in polynomial time in the data complexity, as long as query answering can also be done in polynomial time (in the data complexity) in the underlying classical ontology.