Updating logical databases
Tractable reasoning via approximation
Artificial Intelligence
Propositional belief base update and minimal change
Artificial Intelligence
The description logic handbook: theory, implementation, and applications
The description logic handbook: theory, implementation, and applications
On the update of description logic ontologies at the instance level
AAAI'06 proceedings of the 21st national conference on Artificial intelligence - Volume 2
DL-Lite: tractable description logics for ontologies
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
Consistent evolution of OWL ontologies
ESWC'05 Proceedings of the Second European conference on The Semantic Web: research and Applications
Data Integration through ${\textit{DL-Lite}_{\mathcal A}}$ Ontologies
Semantics in Data and Knowledge Bases
Towards Efficient Belief Update for Planning-Based Web Service Composition
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Conceptual Modeling for Data Integration
Conceptual Modeling: Foundations and Applications
Journal of Artificial Intelligence Research
Model-based revision operators for terminologies in description logics
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
A framework for handling revisions in distributed ontologies
Proceedings of the 2010 ACM Symposium on Applied Computing
Forgetting concepts in DL-lite
ESWC'08 Proceedings of the 5th European semantic web conference on The semantic web: research and applications
Semantic annotation and composition of business processes with Maestro
ESWC'08 Proceedings of the 5th European semantic web conference on The semantic web: research and applications
Towards closed world reasoning in dynamic open worlds
Theory and Practice of Logic Programming
Forgetting for knowledge bases in DL-Lite
Annals of Mathematics and Artificial Intelligence
Ontology reasoning in agent-oriented programming
SBIA'10 Proceedings of the 20th Brazilian conference on Advances in artificial intelligence
OntoRevision: a plug-in system for ontology revision in protégé
JIST'11 Proceedings of the 2011 joint international conference on The Semantic Web
Propositional Update Operators Based on Formula/Literal Dependence
ACM Transactions on Computational Logic (TOCL)
Hi-index | 0.00 |
A Description Logics knowledge base is constituted by two components, called TBox and ABox, where the former expresses general knowledge about the concepts and their relationships, and the latter describes the properties of instances of concepts. We address the problem of how to deal with changes to a Description Logic knowledge base, when these changes affect only its ABox. We consider two types of changes namely update and erasure, and we characterize the semantics of these operations on the basis of the approaches proposed by Winslett and by Katsuno and Mendelzon. It is well known that, in general, Description Logics are not closed with respect to updates, in the sense that the set of models corresponding to an update applied to a knowledge base in a Description Logic L may not be expressible by ABoxes in L. We show that this is true also for erasure. To deal with this problem, we introduce the notion of best approximation of an update (erasure) in a DL L, with the goal of characterizing the L ABoxes that capture the update (erasure) at best. We then focus on DL-LiteF, a tractable Description Logic, and present polynomial algorithms for computing the best approximation of updates and erasures in this logic, which shows that the nice computational properties of DL-LiteF are retained in dealing with the evolution of the ABox.