Log In Sign Up

Learning Query Inseparable ELH Ontologies

by   Cosimo Persia, et al.

We investigate the complexity of learning query inseparable ontologies in a variant of Angluin's exact learning model. Given a fixed data instance A* and a query language Q, we are interested in computing an ontology H that entails the same queries as a target ontology T on *, that is, H and T are inseparable w.r.t. A* and Q. The learner is allowed to pose two kinds of questions. The first is `Does (T,A) q?', with A an arbitrary data instance and q and query in Q. An oracle replies this question with `yes' or `no'. In the second, the learner asks `Are H and T inseparable w.r.t. A* and Q?'. If so, the learning process finishes, otherwise, the learner receives (A*,q) with q in Q, (T,A*) q and (H,A*)q (or vice-versa). Then, we analyse conditions in which query inseparability is preserved if A* changes. Finally, we consider the PAC learning model and a setting where the algorithms learn from a batch of classified data, limiting interactions with the oracles.


page 1

page 2

page 3

page 4


Actively Learning Concepts and Conjunctive Queries under ELr-Ontologies

We consider the problem to learn a concept or a query in the presence of...

Controlled Query Evaluation for Datalog and OWL 2 Profile Ontologies

We study confidentiality enforcement in ontologies under the Controlled ...

Inseparability and Conservative Extensions of Description Logic Ontologies: A Survey

The question whether an ontology can safely be replaced by another, poss...

Dichotomies in Ontology-Mediated Querying with the Guarded Fragment

We study the complexity of ontology-mediated querying when ontologies ar...

Enriching Ontology-based Data Access with Provenance (Extended Version)

Ontology-based data access (OBDA) is a popular paradigm for querying het...

Semi-verified Learning from the Crowd with Pairwise Comparisons

We study the problem of crowdsourced PAC learning of Boolean-valued func...

On Expert Behaviors and Question Types for Efficient Query-Based Ontology Fault Localization

We challenge existing query-based ontology fault localization methods wr...