Preferential Query Answering over the Semantic Web with Possibilistic Networks

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. PDF

Cite

Text

Borgwardt et al. "Preferential Query Answering over the Semantic Web with Possibilistic Networks." International Joint Conference on Artificial Intelligence, 2016.

Markdown

[Borgwardt et al. "Preferential Query Answering over the Semantic Web with Possibilistic Networks." International Joint Conference on Artificial Intelligence, 2016.](https://mlanthology.org/ijcai/2016/borgwardt2016ijcai-preferential/)

BibTeX

@inproceedings{borgwardt2016ijcai-preferential,
  title     = {{Preferential Query Answering over the Semantic Web with Possibilistic Networks}},
  author    = {Borgwardt, Stefan and Fazzinga, Bettina and Lukasiewicz, Thomas and Shrivastava, Akanksha and Tifrea-Marciuska, Oana},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2016},
  pages     = {994-1000},
  url       = {https://mlanthology.org/ijcai/2016/borgwardt2016ijcai-preferential/}
}