Communications of the ACM
Theory of generalized annotated logic programming and its applications
Journal of Logic Programming
A model of multimedia information retrieval
Journal of the ACM (JACM)
Combining fuzzy information: an overview
ACM SIGMOD Record
Possibility Theory, Probability Theory and Multiple-Valued Logics: A Clarification
Annals of Mathematics and Artificial Intelligence
The description logic handbook: theory, implementation, and applications
The description logic handbook: theory, implementation, and applications
RankSQL: query algebra and optimization for relational top-k queries
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Supporting ad-hoc ranking aggregates
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Supporting top-K join queries in relational databases
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Towards top-k query answering in description logics: the case of DL-Lite
JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence
Query answering in normal logic programs under uncertainty
ECSQARU'05 Proceedings of the 8th European conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Top-k Retrieval in Description Logic Programs Under Vagueness for the Semantic Web
SUM '07 Proceedings of the 1st international conference on Scalable Uncertainty Management
Semantic-Based Top-k Retrieval for Competence Management
ISMIS '09 Proceedings of the 18th International Symposium on Foundations of Intelligent Systems
Fuzzy logic, annotation domains and semantic web languages
SUM'11 Proceedings of the 5th international conference on Scalable uncertainty management
Top-k retrieval for ontology mediated access to relational databases
Information Sciences: an International Journal
A top-k query answering procedure for fuzzy logic programming
Fuzzy Sets and Systems
Hi-index | 0.00 |
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.