Return to search

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

Identiferoai:union.ndltd.org:DRESDEN/oai:qucosa:de:qucosa:88776
Date28 December 2023
CreatorsBorgwardt, Stefan, Fazzinga, Bettina, Lukasiewicz, Thomas, Shrivastava, Akanksha, Tifrea-Marciuska, Oana
ContributorsTechnische Universität Dresden
Source SetsHochschulschriftenserver (HSSS) der SLUB Dresden
LanguageEnglish
Detected LanguageEnglish
Typeinfo:eu-repo/semantics/acceptedVersion, doc-type:report, info:eu-repo/semantics/report, doc-type:Text
Rightsinfo:eu-repo/semantics/openAccess
Relationurn:nbn:de:bsz:14-qucosa2-785040, qucosa:78504

Page generated in 0.0021 seconds