We study the problem of evolution for Knowledge Bases (KBs) expressed in Description Logics (DLs) of the DL-Lite family. DL-Lite is at the basis of OWL 2 QL, one of the tractable fragments of OWL 2, the recently proposed revision of the Web Ontology Language. We propose some fundamental principles that KB evolution should respect. We review known model and formula-based approaches for evolution of propositional theories. We exhibit limitations of a number of model-based approaches: besides the fact that they are either not expressible in DL-Lite or hard to compute, they intrinsically ignore the structural properties of KBs, which leads to undesired properties of KBs resulting from such an evolution. We also examine proposals on update and revision of DL KBs that adopt the model-based approaches and discuss their drawbacks. We show that known formula-based approaches are also not appropriate for DL-Lite evolution, either due to high complexity of computation, or because the result of such an action of evolution is not expressible in DL-Lite. Building upon the insights gained, we propose two novel formula-based approaches that respect our principles and for which evolution is expressible in DL-Lite. For our approaches we also developed polynomial time algorithms to compute evolution of DL-Lite KBs.
%0 Conference Paper
%1 Calvanese2010
%A Calvanese, Diego
%A Kharlamov, Evgeny
%A Nutt, Werner
%A Zheleznyakov, Dmitriy
%B Proceedings of the 9th International Semantic Web Conference (ISWC 2010)
%C Shanghai, China
%D 2010
%E Patel-Schneider, Peter F.
%E Pan, Yue
%E Hitzler, Pascal
%E Mika, Peter
%E Zhang, Lei
%E Pan, Jeff Z.
%E Horrocks, Ian
%E Glimm, Birte
%I Springer
%K evolution ontology revision
%P 112--128
%T Evolution of DL-lite knowledge bases
%U http://dl.acm.org/citation.cfm?id=1940281.1940290
%X We study the problem of evolution for Knowledge Bases (KBs) expressed in Description Logics (DLs) of the DL-Lite family. DL-Lite is at the basis of OWL 2 QL, one of the tractable fragments of OWL 2, the recently proposed revision of the Web Ontology Language. We propose some fundamental principles that KB evolution should respect. We review known model and formula-based approaches for evolution of propositional theories. We exhibit limitations of a number of model-based approaches: besides the fact that they are either not expressible in DL-Lite or hard to compute, they intrinsically ignore the structural properties of KBs, which leads to undesired properties of KBs resulting from such an evolution. We also examine proposals on update and revision of DL KBs that adopt the model-based approaches and discuss their drawbacks. We show that known formula-based approaches are also not appropriate for DL-Lite evolution, either due to high complexity of computation, or because the result of such an action of evolution is not expressible in DL-Lite. Building upon the insights gained, we propose two novel formula-based approaches that respect our principles and for which evolution is expressible in DL-Lite. For our approaches we also developed polynomial time algorithms to compute evolution of DL-Lite KBs.
%@ 3-642-17745-X, 978-3-642-17745-3
@inproceedings{Calvanese2010,
abstract = {We study the problem of evolution for Knowledge Bases (KBs) expressed in Description Logics (DLs) of the DL-Lite family. DL-Lite is at the basis of OWL 2 QL, one of the tractable fragments of OWL 2, the recently proposed revision of the Web Ontology Language. We propose some fundamental principles that KB evolution should respect. We review known model and formula-based approaches for evolution of propositional theories. We exhibit limitations of a number of model-based approaches: besides the fact that they are either not expressible in DL-Lite or hard to compute, they intrinsically ignore the structural properties of KBs, which leads to undesired properties of KBs resulting from such an evolution. We also examine proposals on update and revision of DL KBs that adopt the model-based approaches and discuss their drawbacks. We show that known formula-based approaches are also not appropriate for DL-Lite evolution, either due to high complexity of computation, or because the result of such an action of evolution is not expressible in DL-Lite. Building upon the insights gained, we propose two novel formula-based approaches that respect our principles and for which evolution is expressible in DL-Lite. For our approaches we also developed polynomial time algorithms to compute evolution of DL-Lite KBs.},
acmid = {1940290},
added-at = {2011-10-05T17:02:14.000+0200},
address = {Shanghai, China},
author = {Calvanese, Diego and Kharlamov, Evgeny and Nutt, Werner and Zheleznyakov, Dmitriy},
biburl = {https://www.bibsonomy.org/bibtex/27397e006a9c91e9d6ae162e71953214a/utahell},
booktitle = {Proceedings of the 9th International Semantic Web Conference (ISWC 2010)},
description = {Evolution of DL-lite knowledge bases},
editor = {Patel-Schneider, Peter F. and Pan, Yue and Hitzler, Pascal and Mika, Peter and Zhang, Lei and Pan, Jeff Z. and Horrocks, Ian and Glimm, Birte},
interhash = {5d7fd99d4e7193d48d415be7795acb4c},
intrahash = {7397e006a9c91e9d6ae162e71953214a},
isbn = {3-642-17745-X, 978-3-642-17745-3},
keywords = {evolution ontology revision},
numpages = {17},
pages = {112--128},
publisher = {Springer},
timestamp = {2011-12-16T16:27:27.000+0100},
title = {Evolution of DL-lite knowledge bases},
url = {http://dl.acm.org/citation.cfm?id=1940281.1940290},
year = 2010
}