Abstract
Semantics-based applications encapsulate commonly a set of ontologies which represent knowledge formalized from different data sources. Some of these ontologies may change over time since, not only data would be updated but also our understanding on application domain would evolve. To ensure that ontologies remain usable, it is needed to revise ontologies in such a way that takes into account new knowledge and guarantees the principle of minimal change. In this paper, we propose an ontology revision approach which uses finite structures equipped with a total pre-order to characterize a set of models of an ontology. This allows us to introduce a revision operation that satisfies all revision postulates. Moreover, we propose a procedure for revising an ontology expressed in an expressive description logic, namely \(\mathcal {SHIQ}\), and show that the resulting ontology remains expressible in \(\mathcal {SHIQ}\).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Alchourrón, C., Gärdenfors, P., Makinson, D.: On the logic of theory change: partial meet contraction and revision functions. J. Symbolic Logic 50, 510–530 (1985)
Dalal, M.: Investigations into a theory of knowledge base revision. In: Proceedings of AAAI, pp. 475–479 (1988)
De Giacomo, G., Lenzerini, M., Poggi, A., Rosati, R.: On the update of description logic ontologies at the instance level. In: Proceedings of AAAI (2006)
De Giacomo, G., Lenzerini, M., Poggi, A., Rosati, R.: On the approximation of instance level update and erasure in description logics. In: Proceedings of AAAI, pp. 403–408 (2007)
Eiter, T., Gottlob, G.: On the complexity of propositional knowledge base revision, updates, and counterfactuals. Artif. Intell. 57, 227–270 (1992)
Horrocks, I., Sattler, U., Tobies, S.: Practical reasoning for expressive description logics. In: Ganzinger, H., McAllester, D., Voronkov, A. (eds.) LPAR 1999. LNCS, vol. 1705, pp. 161–180. Springer, Heidelberg (1999)
Katsuno, H., Mendelzon, A.O.: Propositional knowledge base revision and minimal change. Artif. Intell. 53(3), 263–294 (1991)
Le Duc, C., Lamolle, M., Curé, O.: A decision procedure for \(\cal SHIQ\) with transitive closure of roles. In: Alani, H., Kagal, L., Fokoue, A., Groth, P., Biemann, C., Parreira, J.X., Aroyo, L., Noy, N., Welty, C., Janowicz, K. (eds.) ISWC 2013, Part I. LNCS, vol. 8218, pp. 264–279. Springer, Heidelberg (2013)
Qi, G., Du, J.: Model-based revision operators for terminologies in description logics. In: IJCAI (2009)
Qi, G., Liu, W., Bell, D.A.: Knowledge base revision in description logics. In: Fisher, M., van der Hoek, W., Konev, B., Lisitsa, A. (eds.) JELIA 2006. LNCS, vol. 4160, pp. 386–398. Springer, Heidelberg (2006)
Ribeiro, M.M., Wassermann, R.: Base revision in description logics - preliminary results. In: Proceedings of IWOD, pp. 69–82 (2007)
Satoh, K.: Nonmonotonic reasoning by minimal belief revision. In: Proceedings of the International Conference on Fifth Generation Computer Systems, pp. 455–462 (1988)
Wang, Z., Wang, K., Topor, R.: A new approach to knowledge base revision in dl-lite. In: Proceedings of 24th AAAI, pp. 369–374 (2010)
Acknowledgements
This work was partially supported by FUI project “Learning Café”.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dong, T., Le Duc, C., Bonnot, P., Lamolle, M. (2015). Tableau-Based Revision over \(\mathcal {SHIQ}\) TBoxes. In: Davis, M., Fehnker, A., McIver, A., Voronkov, A. (eds) Logic for Programming, Artificial Intelligence, and Reasoning. LPAR 2015. Lecture Notes in Computer Science(), vol 9450. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-48899-7_40
Download citation
DOI: https://doi.org/10.1007/978-3-662-48899-7_40
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-48898-0
Online ISBN: 978-3-662-48899-7
eBook Packages: Computer ScienceComputer Science (R0)