论文标题
边界和在DL-Lite本体下的ELI查询的精确学习
Frontiers and Exact Learning of ELI Queries under DL-Lite Ontologies
论文作者
论文摘要
我们在描述逻辑dl-lite中提出的本体学中研究了Eli查询（ELIQ）。对于方言DL-LiteH，我们表明ELIQ具有多项式大小的边界（最不通用的概括），可以在多项式时间内计算。相比之下，在方言DL-Litef中，边界可能是无限的。我们确定了一种自然的句法限制，可以实现与DL-LiteH相同的积极结果。我们在边界上使用结果表明，在Angluin的精确学习框架中，只有会员查询，在dl-liteh /受限的DL-LiteF本体中，在多项式时间内可以学习ELIQ。
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.
