Ontological query answering under many-valued group preferences in Datalog+/–
The Web has recently been changing more and more to what is called the Social Semantic Web. As a consequence, the ranking of search results no longer depends solely on the structure of the interconnections among Web pages. In this paper, we argue that such rankings can be based on user preferences f...
| Autores: | , , , , |
|---|---|
| Formato: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2018 |
| País: | Argentina |
| Recursos: | Consejo Nacional de Investigaciones Científicas y Técnicas |
| Repositorio: | CONICET Digital (CONICET) |
| Idioma: | inglés |
| OAI Identifier: | oai:ri.conicet.gov.ar:11336/93131 |
| Acesso em linha: | http://hdl.handle.net/11336/93131 |
| Access Level: | acceso abierto |
| Palavra-chave: | DATALOG+/- EXISTENTIAL RULES ONTOLOGICAL QUERY ANSWERING PREFERENCES SOCIAL CHOICE TOP-K QUERY ANSWERING https://purl.org/becyt/ford/1.2 https://purl.org/becyt/ford/1 |
| Resumo: | The Web has recently been changing more and more to what is called the Social Semantic Web. As a consequence, the ranking of search results no longer depends solely on the structure of the interconnections among Web pages. In this paper, we argue that such rankings can be based on user preferences from the Social Web and on ontological background knowledge from the Semantic Web. We propose an approach to top-k query answering under user preferences in Datalog+/– ontologies, where the queries are unions of conjunctive queries with safe negation, and the preferences are defined via numerical values. To this end, we also generalize the previous RankJoin algorithm to our framework. Furthermore, we explore the generalization to the preferences of a group of users. Finally, we provide experimental results on the performance and quality of our algorithms. |
|---|