Updating Description Logic ABoxes

Abstract

Description logic (DL) ABoxes are a tool for describing the state of affairs in an application domain. In this paper, we consider the problem of updating ABoxes when the state changes. We assume that changes are described at an atomic level, i.e., in terms of possibly negated ABox assertions that involve only atomic concepts and roles. We analyze such basic ABox updates in several standard DLs by investigating whether the updated ABox can be expressed in these DLs and, if so, whether it is computable and what is its size. It turns out that DLs have to include nominals and the “@” constructor of hybrid logic (or, equivalently, admit Boolean ABoxes) for updated ABoxes to be expressible. We devise algorithms to compute updated ABoxes in several expressive DLs and show that an exponential blowup in the size of the whole input (original ABox + update information) cannot be avoided unless every PTIME problem is LOGTIMEparallelizable. We also exhibit ways to avoid an exponential blowup in the size of the original ABox, which is usually large compared to the update information.

Extracted Key Phrases

5 Figures and Tables

Statistics

02040'06'07'08'09'10'11'12'13'14'15'16'17
Citations per Year

160 Citations

Semantic Scholar estimates that this publication has 160 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{Liu2006UpdatingDL, title={Updating Description Logic ABoxes}, author={Hongkai Liu and Carsten Lutz and Maja Milicic Brandt and Frank Wolter}, booktitle={KR}, year={2006} }