Preferential Query Answering in the Semantic Web with Possibilistic Networks

Stefan BorgwardtStefan Borgwardt, Bettina FazzingaBettina Fazzinga, Thomas LukasiewiczThomas Lukasiewicz, Akanksha ShrivastavaAkanksha Shrivastava, Oana Tifrea-MarciuskaOana Tifrea-Marciuska

Download

Stefan Borgwardt, Bettina Fazzinga, Thomas Lukasiewicz, Akanksha Shrivastava, Oana Tifrea-Marciuska
Preferential Query Answering in the Semantic Web with Possibilistic Networks
In Subbarao Kambhampati, eds., Proceedings of the 25th International Joint Conference on Artificial Intelligence (IJCAI'16), 994–1000, 2016. AAAI Press

Details
Bibtex

KurzfassungAbstract
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.
Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory

@inproceedings{BFLST2016,
  author    = {Stefan Borgwardt and Bettina Fazzinga and Thomas Lukasiewicz and
               Akanksha Shrivastava and Oana Tifrea-Marciuska},
  title     = {Preferential Query Answering in the Semantic Web with
               Possibilistic Networks},
  editor    = {Subbarao Kambhampati},
  booktitle = {Proceedings of the 25th International Joint Conference on
               Artificial Intelligence (IJCAI'16)},
  publisher = {AAAI Press},
  year      = {2016},
  pages     = {994{\textendash}1000}
}