Towards Vague Query Answering in Logic Programming for Logic-Based Information Retrieval

Abstract

Abstract. We address a novel issue for logic programming, namely the problem of evaluating ranked top-k queries. The problem occurs for instance, when we allow queries such as "find cheap hotels close to the conference location" in which vague predicates like cheap and close occur. Vague predicates have the effect that each tuple in the answer set has now a score in [0,1]. We show how to compute the top-k answers in case the set of facts is huge, without evaluating all the tuples.

Top-k Retrieval in Description Logic Programs Under Vagueness for the Semantic Web

“…Closest to our work is clearly [18]. In fact, our work extends [18] by allowing expensive fuzzy predicates, which have the effect that the threshold mechanism designed in [18] does not work anymore. Furthermore, in this paper, we made an effort to plug-in current top-k database technology, while [18] does not and provides an ad-hoc solution.…”

“…The work [19] shows an application of top-k retrieval to the case of multimedia information retrieval by relying on a fuzzy variant of DLR-Lite. Finally, [18] addresses the top-k retrieval for general (recursive) fuzzy LPs, though no expensive fuzzy predicates are allowed. Closest to our work is clearly [18].…”

“…Finally, [18] addresses the top-k retrieval for general (recursive) fuzzy LPs, though no expensive fuzzy predicates are allowed. Closest to our work is clearly [18]. In fact, our work extends [18] by allowing expensive fuzzy predicates, which have the effect that the threshold mechanism designed in [18] does not work anymore.…”

“…In fact, our work extends [18] by allowing expensive fuzzy predicates, which have the effect that the threshold mechanism designed in [18] does not work anymore. Furthermore, in this paper, we made an effort to plug-in current top-k database technology, while [18] does not and provides an ad-hoc solution. Though we have not yet performed experimental evaluations, we hope that this choice, beside allowing a more expressive language, will provide better efficiency.…”

Semantic-Based Top-k Retrieval for Competence Management

“…The logic extends DLR-Lite by enriching it with built-in predicates. Conjunctive queries are enriched with scoring functions that allow to rank and retrieve the top-k answers, that is, we support Top-k Query Answering [14,17,18,19,20], (find top-k scored tuples satisfying query), e.g., "find candidates with excellent knowledge in DLR-Lite", where EXCELLENT is a function of the years of experience.…”