Towards Top-k Query Answering in Description Logics: The Case of DL-Lite

DOI10.1007/11853886_36zbMath1152.68618OpenAlexW1579093283MaRDI QIDQ3533151

Umberto Straccia

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

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Knowledge representation (68T30) Reasoning under uncertainty in the context of artificial intelligence (68T37)

Related Items (9)

Similarity-based relaxed instance queries ⋮ Tightly integrated probabilistic description logic programs for representing ontology mappings ⋮ From Fuzzy to Annotated Semantic Web Languages ⋮ All About Fuzzy Description Logics and Applications ⋮ A top-\(k\) query answering procedure for fuzzy logic programming ⋮ Top-\(k\) retrieval for ontology mediated access to relational databases ⋮ Tightly Integrated Probabilistic Description Logic Programs for Representing Ontology Mappings ⋮ Reasoning within fuzzy OWL 2 EL revisited ⋮ Ontologies and Databases: The DL-Lite Approach

This page was built for publication: Towards Top-k Query Answering in Description Logics: The Case of DL-Lite