Skip to main content

Preferential Query Answering over the Semantic Web with Possibilistic Networks

Stefan Borgwardt‚ Bettina Fazzinga‚ Thomas Lukasiewicz‚ Akanksha Shrivastava and Oana Tifrea−Marciuska

Abstract

In this paper, we explore how ontological knowledge expressed via existential rules can be combined with possibilistic networks (i) to represent qualitative preferences along with domain knowledge, and (ii) to realize preference-based answering of conjunctive queries (CQs). We call these combinations ontological possibilistic networks (OP-nets). We define skyline and k-rank answers to CQs under preferences and provide complexity (including data tractability) results for deciding consistency and CQ skyline membership for OP-nets. We show that our formalism has a lower complexity than a similar existing formalism.

Book Title
Proceedings of the 25th International Joint Conference on Artificial Intelligence‚ IJCAI 2016‚ New York‚ NY‚ USA‚ July 9−15‚ 2016
Editor
Subbarao Kambhampati
Month
July
Pages
994−1000
Publisher
IJCAI/AAAI Press
Year
2016