Computing Repairs for Inconsistent DL-programs over EL Ontologies

Abstract DL-programs couple nonmonotonic logic programs with DL- ontologies through queries in a loose way which may lead to inconsistency, i. e. , lack of an answer set. Recently defined repair answer sets remedy this. In particular, for \(DL-Lite_{\mathcal{A}}\) ontologies, the computation of deletion repair answer sets can effectively be reduced to constraint matching based on so-called support sets. Here we consider the problem for DL-programs over \(\mathcal{EL}\) ontologies. This is more challenging than adopting a suitable notion of support sets and their computation. Compared to \(DL-Lite_{\mathcal{A}}\), support sets may neither be small nor few, and completeness may need to be given up in favor of sound repair computation on incomplete support information. We provide such an algorithm and discuss partial support set computation, as well as a declarative implementation. Preliminary experiments show a very promising potential of the partial support set approach.

Authors

• Thomas Eiter
• Michael Fink 0001
• Daria Stepanova 0001

Keywords

No keywords are indexed for this paper.