Top-k retrieval for ontology mediated access to relational databases
From MaRDI portal
(Redirected from Publication:712661)
Recommendations
- Towards Top-k Query Answering in Description Logics: The Case of DL-Lite
- Complexity and expressive power of ontology-mediated queries (invited talk)
- Top-\( k\) queries on RDF graphs
- Ontology-based data access: a study through disjunctive Datalog, CSP, and MMSNP
- Query Rewriting and Optimization for Ontological Databases
Cites work
- scientific article; zbMATH DE number 1936671 (Why is no real title available?)
- scientific article; zbMATH DE number 5040084 (Why is no real title available?)
- Data Integration through ${\textit{DL-Lite}_{\mathcal A}}$ Ontologies
- Data complexity of query answering in description logics
- Deciding expressive description logics in the framework of resolution
- Description Logic Programs Under Probabilistic Uncertainty and Fuzzy Vagueness
- Description logic programs under probabilistic uncertainty and fuzzy vagueness
- Fuzzy description logic programs
- Hybrid query answering over OWL ontologies
- Implementing imprecision in information systems
- Linking Data to Ontologies
- On a fuzzy bipolar relational algebra
- Optimal aggregation algorithms for middleware.
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
- Towards Top-k Query Answering in Description Logics: The Case of DL-Lite
- Towards Vague Query Answering in Logic Programming for Logic-Based Information Retrieval
- Tractable query answering and rewriting under description logic constraints
- Tractable reasoning and efficient query answering in description logics: The DL-Lite family
Cited in
(3)
This page was built for publication: Top-\(k\) retrieval for ontology mediated access to relational databases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q712661)
