Conference item icon

Conference item

Preferential query answering in 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.
Publication status:
Published
Peer review status:
Peer reviewed

Actions


Access Document


Files:
Publisher copy:
10.1007/978-3-319-46073-4

Authors


More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Computer Science
Role:
Author
ORCID:
0000-0002-7644-1668


Publisher:
Springer, Cham
Host title:
KI 2016: Advances in Artificial Intelligence
Journal:
KI 2016: Advances in Artificial Intelligence More from this journal
Volume:
9904
Pages:
264-270
Series:
Lecture Notes in Computer Science
Publication date:
2016-09-08
Acceptance date:
2016-06-27
DOI:
ISSN:
0302-9743
ISBN:
9783319460727


Pubs id:
pubs:718515
UUID:
uuid:3eb121f6-1b60-472b-a8cc-5055394cf8f7
Local pid:
pubs:718515
Source identifiers:
718515
Deposit date:
2018-09-10

Terms of use



Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP