An ABox Revision Algorithm for the Description Logic EL_bot
Liang Chang, Ulrike Sattler, Tianlong Gu · Research Explorer (The University of Manchester) · 2014
Revision of knowledge bases (KBs) expressed in description logics (DLs) has gained a lot of attention lately.Existing revision algorithms can be divided into two groups: model-based approaches (MBAs) and formula-based approaches (FBAs).MBAs are fine-grained and independent of the syntactical forms of KBs; however, they only work for some restricted forms of the DL-Lite family.FBAs can deal with more expressive DLs such as SHOIN , but they are syntax-dependent and not fine-grained.In this paper, we present a new method for instancelevel revision of KBs.In our algorithm, a non-redundant depth-bounded model is firstly constructed for the KB to be revised; then a revision process based on justifications is carried out on this model by treating a model as a set of assertions; finally the resulting model is mapped back to a KB which will be returned by the algorithm.Our algorithm is syntax-independent and fine-grained, and works for the DL EL ⊥ .