Revising general knowledge bases in description logics

Zhe Wang, Kewen Wang, Rodney W. Topor · 2010

Revising knowledge bases (KBs) in description logics (DLs) in a syntax-independent manner is an important and nontrivial problem for ontology management and DL communities. Several attempts have been made to adapt classical modelbased belief revision/update techniques to DLs, but they are restricted in several ways. In particular, they rarely investigate how to deal with revisions of general DL KBs. An important reason for this is that, unlike propositional logic, a DL KB may have infinitely many models with complex (and possibly infinite) structures, making it difficult to define and compute revisions in terms of models. In this paper, we focus on a specific DL in the DL-Lite family, but aim to define and compute revision by general KBs. For this reason, we first develop an alternative semantic characterization for DL-Lite by introducing the concept of a feature (as an alternative to a model) and then define specific revision operators for DL-Lite KBs based on features. We also present an algorithm for computing best approximations for KB revisions in DL-Lite.

Read the paper · More papers on PaperTik