Frontiers and Exact Learning of ELI Queries under DL-Lite Ontologies

04/29/2022
by   Maurice Funk, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/20/2017

Exact Learning of Lightweight Description Logic Ontologies

We study the problem of learning description logic (DL) ontologies in An...
research
05/06/2020

On the Learnability of Possibilistic Theories

We investigate learnability of possibilistic theories from entailments i...
research
07/27/2021

Efficient TBox Reasoning with Value Restrictions using the ℱℒ_ower reasoner

The inexpressive Description Logic (DL) ℱℒ_0, which has conjunction and ...
research
05/08/2013

Semantic-based Anomalous Pattern Discovery in Moving Object Trajectories

In this work, we investigate a novel semantic approach for pattern disco...
research
04/20/2015

Computing Horn Rewritings of Description Logics Ontologies

We study the problem of rewriting an ontology O1 expressed in a DL L1 in...
research
02/08/2019

Learning Ontologies with Epistemic Reasoning: The EL Case

We investigate the problem of learning description logic ontologies from...
research
08/16/2020

Conjunctive Queries: Unique Characterizations and Exact Learnability

We answer the question which conjunctive queries are uniquely characteri...

Please sign up or login with your details

Forgot password? Click here to reset