Towards Top-k Query Answering in Description Logics: The Case of DL-Lite
From MaRDI portal
Publication:3533151
DOI10.1007/11853886_36zbMATH Open1152.68618OpenAlexW1579093283MaRDI QIDQ3533151FDOQ3533151
Publication date: 30 October 2008
Published in: Logics in Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11853886_36
Recommendations
- Tractable reasoning and efficient query answering in description logics: The DL-Lite family
- Towards Vague Query Answering in Logic Programming for Logic-Based Information Retrieval
- A top-\(k\) query answering procedure for fuzzy logic programming
- Data complexity of query answering in description logics
- Query answering in fuzzy DL-Lite with graded axioms
Reasoning under uncertainty in the context of artificial intelligence (68T37) Knowledge representation (68T30) Logic in artificial intelligence (68T27)
Cited In (11)
- Query answering in fuzzy DL-Lite with graded axioms
- A top-\(k\) query answering procedure for fuzzy logic programming
- Tightly integrated probabilistic description logic programs for representing ontology mappings
- Tightly Integrated Probabilistic Description Logic Programs for Representing Ontology Mappings
- Top-\(k\) retrieval for ontology mediated access to relational databases
- Similarity-based relaxed instance queries
- Reasoning within fuzzy OWL 2 EL revisited
- Ontologies and Databases: The DL-Lite Approach
- Query answering DL-lite knowledge bases from hidden datasets
- All About Fuzzy Description Logics and Applications
- From Fuzzy to Annotated Semantic Web Languages
This page was built for publication: Towards Top-k Query Answering in Description Logics: The Case of DL-Lite
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3533151)
