Preferential query answering in the semantic web with possibilistic networks
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 combination...
| मुख्य लेखकों: | , , , , |
|---|---|
| स्वरूप: | Conference item |
| प्रकाशित: |
Springer, Cham
2016
|
| _version_ | 1826268626695487488 |
|---|---|
| author | Borgwardt, S Fazzinga, B Lukasiewicz, T Shrivastava, A Tifrea-Marciuska, O |
| author_facet | Borgwardt, S Fazzinga, B Lukasiewicz, T Shrivastava, A Tifrea-Marciuska, O |
| author_sort | Borgwardt, S |
| collection | OXFORD |
| description | 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. |
| first_indexed | 2024-03-06T21:12:36Z |
| format | Conference item |
| id | oxford-uuid:3eb121f6-1b60-472b-a8cc-5055394cf8f7 |
| institution | University of Oxford |
| last_indexed | 2024-03-06T21:12:36Z |
| publishDate | 2016 |
| publisher | Springer, Cham |
| record_format | dspace |
| spelling | oxford-uuid:3eb121f6-1b60-472b-a8cc-5055394cf8f72022-03-26T14:27:05ZPreferential query answering in the semantic web with possibilistic networksConference itemhttp://purl.org/coar/resource_type/c_5794uuid:3eb121f6-1b60-472b-a8cc-5055394cf8f7Symplectic Elements at OxfordSpringer, Cham2016Borgwardt, SFazzinga, BLukasiewicz, TShrivastava, ATifrea-Marciuska, OIn 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. |
| spellingShingle | Borgwardt, S Fazzinga, B Lukasiewicz, T Shrivastava, A Tifrea-Marciuska, O Preferential query answering in the semantic web with possibilistic networks |
| title | Preferential query answering in the semantic web with possibilistic networks |
| title_full | Preferential query answering in the semantic web with possibilistic networks |
| title_fullStr | Preferential query answering in the semantic web with possibilistic networks |
| title_full_unstemmed | Preferential query answering in the semantic web with possibilistic networks |
| title_short | Preferential query answering in the semantic web with possibilistic networks |
| title_sort | preferential query answering in the semantic web with possibilistic networks |
| work_keys_str_mv | AT borgwardts preferentialqueryansweringinthesemanticwebwithpossibilisticnetworks AT fazzingab preferentialqueryansweringinthesemanticwebwithpossibilisticnetworks AT lukasiewiczt preferentialqueryansweringinthesemanticwebwithpossibilisticnetworks AT shrivastavaa preferentialqueryansweringinthesemanticwebwithpossibilisticnetworks AT tifreamarciuskao preferentialqueryansweringinthesemanticwebwithpossibilisticnetworks |