资源分类
》 资源 》论文》Preferential Query Answering in the Semantic Web with Possibilistic Networks

Preferential Query Answering in the Semantic Web with Possibilistic Networks

2019-11-25 | |  93 |   41 |   0
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 (OPnets). 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.

上一篇：Evaluation of Arguments from Support Relations: Axioms and Semantics

下一篇：An ASP Semantics for Default Reasoning with Constraints

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...