Konev, Boris ORCID: 0000-0002-6507-0494, Lutz, Carsten, Ozaki, Ana and Wolter, Frank
(2018)
Exact Learning of Lightweight Description Logic Ontologies.
Journal of Machine Learning Research, 18 (201).
pp. 1-63.
This is the latest version of this item.
Text
learningDLRevision.pdf - Author Accepted Manuscript Available under License : See the attached licence file. Download (663kB) |
|
Text
jmlr18.pdf - Author Accepted Manuscript Available under License : See the attached licence file. Download (720kB) |
Abstract
We study the problem of learning description logic (DL) ontologies in Angluin et al.'s framework of exact learning via queries. We admit membership queries ("is a given subsumption entailed by the target ontology?") and equivalence queries ("is a given ontology equivalent to the target ontology?"). We present three main results: (1) ontologies formulated in (two relevant versions of) the description logic DL-Lite can be learned with polynomially many queries of polynomial size; (2) this is not the case for ontologies formulated in the description logic EL, even when only acyclic ontologies are admitted; and (3) ontologies formulated in a fragment of EL related to the web ontology language OWL 2 RL can be learned in polynomial time. We also show that neither membership nor equivalence queries alone are sufficient in cases (1) and (3).
Item Type: | Article |
---|---|
Uncontrolled Keywords: | Exact Learning, Description Logic, Complexity |
Depositing User: | Symplectic Admin |
Date Deposited: | 15 Dec 2020 10:22 |
Last Modified: | 18 Jan 2023 23:18 |
Related URLs: | |
URI: | https://livrepository.liverpool.ac.uk/id/eprint/3110033 |
Available Versions of this Item
-
Exact Learning of Lightweight Description Logic Ontologies. (deposited 31 Jan 2018 07:48)
- Exact Learning of Lightweight Description Logic Ontologies. (deposited 15 Dec 2020 10:22) [Currently Displayed]