Updating logical databases
On the complexity of propositional knowledge base revision, updates, and counterfactuals
Artificial Intelligence
The description logic handbook: theory, implementation, and applications
The description logic handbook: theory, implementation, and applications
A Tableau Decision Procedure for $\mathcal{SHOIQ}$
Journal of Automated Reasoning
Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family
Journal of Automated Reasoning
Update semantics for incomplete databases
VLDB '85 Proceedings of the 11th international conference on Very Large Data Bases - Volume 11
Ontology change: Classification and survey
The Knowledge Engineering Review
On Instance-level Update and Erasure in Description Logic Ontologies
Journal of Logic and Computation
The DL-lite family and relations
Journal of Artificial Intelligence Research
Journal on data semantics X
Evolution of DL-lite knowledge bases
ISWC'10 Proceedings of the 9th international semantic web conference on The semantic web - Volume Part I
Capturing model-based ontology evolution at the instance level: The case of DL-Lite
Journal of Computer and System Sciences
Hi-index | 0.00 |
Evolution of Knowledge Bases (KBs) expressed in Description Logics (DLs) proved its importance. Recent studies of the topic mostly focussed on model-based approaches (MBAs), where an evolution (of a KB) results in a set of models. For KBs expressed in tractable DLs, such as DL-Lite, it was shown that the evolution suffers from inexpressibility, i.e., the result of evolution cannot be expressed in DL-Lite.What is missing in these studies is understanding: inwhich DL-Lite fragments evolution can be captured, what causes the inexpressibility, which logics is sufficient to express evolution, whether and how one can approximate it in DL-Lite. This work provides some understanding of these issues for eight of MBAs which cover the case of both update and revision. We found what causes inexpressibility and isolated a fragment of DL-Lite where evolution is expressible. For this fragment we provided polynomial-time algorithms to compute evolution results. For the general case we proposed techniques (based on what we called prototypes) to capture DL-Lite evolution corresponding to a well-known Winslett's approach in a DL SHOIQ (which is subsumed by OWL 2 DL). We also showed how to approximate this evolution in DL-Lite.