As a guest user you are not logged in or recognized by your IP address. You have
access to the Front Matter, Abstracts, Author Index, Subject Index and the full
text of Open Access publications.
Finding an appropriate semantics for task of updating an inconsistent knowledge base is a challenging problem. In this paper, we consider knowledge bases expressed in Description Logics, and focus on ABox inconsistencies, i.e., the case where the TBox is consistent, but the whole knowledge base is not. Our first contribution is the definition of a new semantics for updating an inconsistent Description Logic knowledge base with both the insertion and the deletions of a set of ABox assertions. We then concentrate on the
DL-Lite family of Description Logics, and present algorithms for updating a possibly inconsistent knowledge base expressed in the most expressive logic of such family. We show that, by virtue of both the characteristics of our semantics, and the limited expressive power of DL-Lite, both insertions and deletions can be done in polynomial time with respect of the size of the ABox.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.