Optimal aggregation algorithms for middleware
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A model of multimedia information retrieval
Journal of the ACM (JACM)
Minimal probing: supporting expensive predicates for top-k queries
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Combining fuzzy information: an overview
ACM SIGMOD Record
Top-k selection queries over relational databases: Mapping strategies and performance evaluation
ACM Transactions on Database Systems (TODS)
Evaluating top-k queries over web-accessible databases
ACM Transactions on Database Systems (TODS)
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
Adaptive rank-aware query optimization in relational databases
ACM Transactions on Database Systems (TODS)
Supporting top-K join queries in relational databases
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Vague Knowledge Bases for Matchmaking in P2P E-Marketplaces
ESWC '07 Proceedings of the 4th European conference on The Semantic Web: Research and Applications
Towards Vague Query Answering in Logic Programming for Logic-Based Information Retrieval
IFSA '07 Proceedings of the 12th international Fuzzy Systems Association world congress on Foundations of Fuzzy Logic and Soft Computing
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
Combining Fuzzy Description Logics and Fuzzy Logic Programs
WI-IAT '08 Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 03
Semantic-Based Top-k Retrieval for Competence Management
ISMIS '09 Proceedings of the 18th International Symposium on Foundations of Intelligent Systems
Uncertainty in the Semantic Web
SUM '09 Proceedings of the 3rd International Conference on Scalable Uncertainty Management
Uncertainty Reasoning for the Semantic Web
RR '09 Proceedings of the 3rd International Conference on Web Reasoning and Rule Systems
A Minimal Deductive System for General Fuzzy RDF
RR '09 Proceedings of the 3rd International Conference on Web Reasoning and Rule Systems
Deciding Query Entailment for Fuzzy $\mathcal{SHIN}$ Ontologies
ASWC '09 Proceedings of the 4th Asian Conference on The Semantic Web
Combining fuzzy logic and semantic web to enable situation-awareness in service recommendation
DEXA'10 Proceedings of the 21st international conference on Database and expert systems applications: Part I
Towards learning fuzzy DL inclusion axioms
WILF'11 Proceedings of the 9th international conference on Fuzzy logic and applications
Fuzzy logic, annotation domains and semantic web languages
SUM'11 Proceedings of the 5th international conference on Scalable uncertainty management
Aggregated Fuzzy Answer Set Programming
Annals of Mathematics and Artificial Intelligence
A core language for fuzzy answer set programming
International Journal of Approximate Reasoning
Top-k retrieval for ontology mediated access to relational databases
Information Sciences: an International Journal
Tightly integrated probabilistic description logic programs for representing ontology mappings
Annals of Mathematics and Artificial Intelligence
Description logics and fuzzy probability
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
A top-k query answering procedure for fuzzy logic programming
Fuzzy Sets and Systems
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Hi-index | 0.00 |
Description logics (DLs) and logic programs (LPs) are important representation languages for the Semantic Web. In this paper, we address an emerging problem in such languages, namely, the problem of evaluating ranked top-k queries. Specifically, we show how to compute the top-k answers in a data-complexity tractable combination of DLs and LPs under vagueness.