Top-\(k\) retrieval for ontology mediated access to relational databases
From MaRDI portal
Publication:712661
DOI10.1016/j.ins.2012.02.026zbMath1248.68187WikidataQ58049229 ScholiaQ58049229MaRDI QIDQ712661
Publication date: 17 October 2012
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2012.02.026
68P15: Database theory
68T30: Knowledge representation
68P20: Information storage and retrieval of data
Related Items
Ontological query answering under many-valued group preferences in Datalog\(+/-\), Reasoning within fuzzy OWL 2 EL revisited
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Tractable query answering and rewriting under description logic constraints
- Implementing imprecision in information systems
- Optimal aggregation algorithms for middleware.
- Tractable reasoning and efficient query answering in description logics: The DL-Lite family
- On a fuzzy bipolar relational algebra
- Description Logic Programs Under Probabilistic Uncertainty and Fuzzy Vagueness
- 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
- Linking Data to Ontologies
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
- Data Integration through ${\textit{DL-Lite}_{\mathcal A}}$ Ontologies
