Updating logical databases
On the complexity of propositional knowledge base revision, updates, and counterfactuals
Artificial Intelligence
Tractable reasoning via approximation
Artificial Intelligence
Testing implications of data dependencies
ACM Transactions on Database Systems (TODS)
Data exchange: getting to the core
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
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
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Ontology change: Classification and survey
The Knowledge Engineering Review
Web Semantics: Science, Services and Agents on the World Wide Web
Conceptual Modeling for Data Integration
Conceptual Modeling: Foundations and Applications
Ontologies and Databases: The DL-Lite Approach
Reasoning Web. Semantic Technologies for Information Systems
Model-based revision operators for terminologies in description logics
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
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 instance level ontology evolution for DL-lite
ISWC'11 Proceedings of the 10th international conference on The semantic web - Volume Part I
Hi-index | 0.00 |
Evolution of Knowledge Bases (KBs) expressed in Description Logics (DLs) has gained a lot of attention lately. Recent studies on the topic have mostly focused on so-called model-based approaches (MBAs), where the evolution of a KB results in a set of models. For KBs expressed in tractable DLs, such as those of the DL-Lite family, which we consider here, it has been shown that one faces inexpressibility of evolution, i.e., the result of evolution of a DL-Lite KB in general cannot be expressed in DL-Lite, in other words, DL-Lite is not closed under evolution. What is still missing in these studies is a thorough understanding of various important aspects of the evolution problem for DL-Lite KBs: Which fragments of DL-Lite are closed under evolution? What causes the inexpressibility? Can one approximate evolution in DL-Lite, and if yes, how? This work provides some understanding of these issues for an important class of MBAs, which cover the cases of both update and revision. We describe what causes inexpressibility, and we propose techniques (based on what we call prototypes) that help to approximate evolution under the well-known approach by Winslett, which is inexpressible in DL-Lite. We also identify a fragment of DL-Lite closed under evolution, and for this fragment we provide polynomial-time algorithms to compute or approximate evolution results for various MBAs.