Preferential Query Answering over the Semantic Web with Possibilistic Networks
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence. Pages 994-999.
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.
@inproceedings{ijcai2016p145,
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 = {Proceedings of the Twenty-Fifth International Joint Conference on
Artificial Intelligence, {IJCAI-16}},
publisher = {AAAI Press / International Joint Conferences on Artificial Intelligence},
editor = {Subbarao Kambhampati},
pages = {994--999},
year = {2016},
month = {7},
url = {https://ijcai.org/proceedings/2016/145},
}
TY - CPAPER TI - Preferential Query Answering over the Semantic Web with Possibilistic Networks AU - Borgwardt, Stefan AU - Fazzinga, Bettina AU - Lukasiewicz, Thomas AU - Shrivastava, Akanksha AU - Tifrea-Marciuska, Oana T2 - Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI-16 PB - AAAI Press / International Joint Conferences on Artificial Intelligence PY - 2016 SP - 994 EP - 999 UR - https://ijcai.org/proceedings/2016/145 ER -Copied
Machine-readable versions of this paper, for tools and AI agents: