Author:
Konev B.,Ludwig M.,Walther D.,Wolter F.
Abstract
We study a logic-based approach to versioning of ontologies. Under this view, ontologies provide answers to queries about some vocabulary of interest. The difference between two versions of an ontology is given by the set of queries that receive different answers.
We investigate this approach for terminologies given in the description logic EL extended with role inclusions and domain and range restrictions for three distinct types of queries: subsumption, instance, and conjunctive queries. In all three cases, we present polynomial-time algorithms that decide whether two terminologies give the same answers to queries over a given vocabulary and compute a succinct representation of the difference if it is non-
empty. We present an implementation, CEX2, of the developed algorithms for subsumption and instance queries and apply it to distinct versions of Snomed CT and the NCI ontology.
Cited by
21 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Highly-Optimized Forgetting for Creating Signature-Based Views of Ontologies;Proceedings of the 32nd ACM International Conference on Information and Knowledge Management;2023-10-21
2. Knowledge forgetting in propositional μ-calculus;Annals of Mathematics and Artificial Intelligence;2022-09-26
3. Forgetting in Answer Set Programming – A Survey;Theory and Practice of Logic Programming;2021-12-27
4. Tracking Semantic Evolutionary Changes in Large-Scale Ontological Knowledge Bases;Proceedings of the 30th ACM International Conference on Information & Knowledge Management;2021-10-26
5. On Syntactic Forgetting Under Uniform Equivalence;Logics in Artificial Intelligence;2021