Frontiers and Exact Learning of ELI Queries under DL-Lite Ontologies
Artificial Intelligence
2022-05-02 v1
Abstract
We study ELI queries (ELIQs) in the presence of ontologies formulated in the description logic DL-Lite. For the dialect DL-LiteH, we show that ELIQs have a frontier (set of least general generalizations) that is of polynomial size and can be computed in polynomial time. In the dialect DL-LiteF, in contrast, frontiers may be infinite. We identify a natural syntactic restriction that enables the same positive results as for DL-LiteH. We use out results on frontiers to show that ELIQs are learnable in polynomial time in the presence of a DL-LiteH / restricted DL-LiteF ontology in Angluin's framework of exact learning with only membership queries.
Keywords
Cite
@article{arxiv.2204.14172,
title = {Frontiers and Exact Learning of ELI Queries under DL-Lite Ontologies},
author = {Maurice Funk and Jean Christoph Jung and Carsten Lutz},
journal= {arXiv preprint arXiv:2204.14172},
year = {2022}
}
Comments
24 pages, long version of a paper accepted at IJCAI 2022