Updating logical databases
On the complexity of propositional knowledge base revision, updates, and counterfactuals
Artificial Intelligence
On the relative expressiveness of description logics and predicate logics
Artificial Intelligence
The size of a revised knowledge base
Artificial Intelligence
Nondeterministic Actions in the Fluent Calculus: Disjunctive State Update Axioms
Intellectics and Computational Logic (to Wolfgang Bibel on the occasion of his 60th birthday)
A Road-Map on Complexity for Hybrid Logics
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
Modal Logic and the Two-Variable Fragment
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Some connections between nonuniform and uniform complexity classes
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
The description logic handbook: theory, implementation, and applications
The description logic handbook: theory, implementation, and applications
Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family
Journal of Automated Reasoning
Ontology change: Classification and survey
The Knowledge Engineering Review
Integrating Action Calculi and Description Logics
KI '07 Proceedings of the 30th annual German conference on Advances in Artificial Intelligence
Integrating description logics and action formalisms: first results
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
Journal of Artificial Intelligence Research
Introducing actions into qualitative simulation
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 2
Causal theories of action: a computational core
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Model-based revision operators for terminologies in description logics
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Conjunctive query answering in the description logic EL using a relational database system
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Special Issue on Ontology Dynamics
Journal of Logic and Computation
On Instance-level Update and Erasure in Description Logic Ontologies
Journal of Logic and Computation
A dynamic description logic for representation and reasoning about actions
KSEM'07 Proceedings of the 2nd international conference on Knowledge science, engineering and management
Putting abox updates into action
FroCoS'09 Proceedings of the 7th international conference on Frontiers of combining systems
A description logic based situation calculus
Annals of Mathematics and Artificial Intelligence
Embracing causality in specifying the indeterminate effects of actions
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Reasoning about actions using description logics with general TBoxes
JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence
Knowledge base revision in description logics
JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence
Probabilistic reasoning in DL-lite
PRICAI'12 Proceedings of the 12th Pacific Rim international conference on Trends in Artificial Intelligence
On the succinctness of some modal logics
Artificial Intelligence
Hi-index | 0.01 |
In description logic (DL), ABoxes are used for describing the state of affairs in an application domain. We consider the problem of updating ABoxes when the state changes, assuming that update information is described at an atomic level, i.e., in terms of possibly negated ABox assertions that involve only atomic concepts and roles. We analyze such basic ABox updates in several standard DLs, in particular addressing questions of expressibility and succinctness: can updated ABoxes always be expressed in the DL in which the original ABox was formulated and, if so, what is the size of the updated ABox? It turns out that DLs have to include nominals and the '@' constructor of hybrid logic for updated ABoxes to be expressible, and that this still holds when updated ABoxes are approximated. Moreover, the size of updated ABoxes is exponential in the role depth of the original ABox and the size of the update. We also show that this situation improves when updated ABoxes are allowed to contain additional auxiliary symbols. Then, DLs only need to include nominals for updated ABoxes to exist, and the size of updated ABoxes is polynomial in the size of both the original ABox and the update.