Name
Abstract | ||
|---|---|---|
The application of automated reasoning approaches to Description Logic (DL) ontologies may produce certain consequences that either are deemed to be wrong or should be hidden for privacy reasons. The question is then how to repair the ontology such that the unwanted consequences can no longer be deduced. An optimal repair is one where the least amount of other consequences is removed. Most of the previous approaches to ontology repair are of a syntactic nature in that they remove or weaken the axioms explicitly present in the ontology, and thus cannot achieve semantic optimality. In previous work, we have addressed the problem of computing optimal repairs of (quantified) ABoxes, where the unwanted consequences are described by concept assertions of the lightweight DL EL. In the present paper, we improve on the results achieved so far in two ways. First, we allow for the presence of terminological knowledge in the form of an EL TBox. This TBox is assumed to be static in the sense that it cannot be changed in the repair process. Second, the construction of optimal repairs described in our previous work is best case exponential. We introduce an optimized construction that is exponential only in the worst case. First experimental results indicate that this reduces the size of the computed optimal repairs considerably. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1007/978-3-030-79876-5_18 | AUTOMATED DEDUCTION, CADE 28 |
DocType | Volume | ISSN |
Conference | 12699 | 0302-9743 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Franz Baader | 1 | 11 | 2.82 |
| Patrick Koopmann | 2 | 11 | 5.60 |
| Francesco Kriegel | 3 | 3 | 4.46 |
| Adrian Nuradiansyah | 4 | 0 | 1.69 |