Efficient Computation of Signature-Restricted Views for Semantic Web Ontologies
Keywords: ontologies, description logics, the semantic web
Abstract: Uniform Interpolation (UI) is an advanced reasoning procedure used to narrow down an ontology to a restricted view. This new ontology will only consist of the relevant names, yet it will retain their original meanings. UI is immensely promising due to its applicability across various domains where custom views of ontologies are essential. Nonetheless, to unlock its full potential, we need optimized techniques to generate these tailored views. Earlier studies suggest that creating uniform interpolants for \el-ontologies is notably challenging. In some instances, it is not even feasible to compute a uniform interpolant. When feasible, the size can be exponentially larger than the initial ontology. Despite these challenges, our paper introduces an improved "forgetting" technique specifically designed for computing uniform interpolants of \eli-ontologies. We demonstrate that, with good reduction and inference strategies, such uniform interpolants can be efficiently computed. A comprehensive evaluation with a prototypical implementation of the method shows superb success rates over two popular benchmark datasets and demonstrates a clear computational advantage over state-of-the-art systems.
Track: Semantics and Knowledge
Submission Guidelines Scope: Yes
Submission Guidelines Blind: Yes
Submission Guidelines Format: Yes
Submission Guidelines Limit: Yes
Submission Guidelines Authorship: Yes
Student Author: No
Submission Number: 18
Loading