A Semantic Web Primer
The Description Logic Handbook
The Description Logic Handbook
Just the right amount: extracting modules from ontologies
Proceedings of the 16th international conference on World Wide Web
Semantic forgetting in answer set programming
Artificial Intelligence
The Logical Difference Problem for Description Logic Terminologies
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
ASWC '08 Proceedings of the 3rd Asian Semantic Web Conference on The Semantic Web
Propositional independence: formula-variable independence and forgetting
Journal of Artificial Intelligence Research
A logical framework for modularity of ontologies
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Conservative extensions in expressive description logics
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Forgetting and uniform interpolation in large-scale description logic terminologies
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Combining OWL ontologies using E-Connections
Web Semantics: Science, Services and Agents on the World Wide Web
Forgetting concepts in DL-lite
ESWC'08 Proceedings of the 5th European semantic web conference on The semantic web: research and applications
Winnowing ontologies based on application use
ESWC'06 Proceedings of the 3rd European conference on The Semantic Web: research and applications
Uniform Interpolation for $\mathcal{ALC}$ Revisited
AI '09 Proceedings of the 22nd Australasian Joint Conference on Advances in Artificial Intelligence
Towards closed world reasoning in dynamic open worlds
Theory and Practice of Logic Programming
Tableau-based Forgetting in ALC Ontologies
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Forgetting for knowledge bases in DL-Lite
Annals of Mathematics and Artificial Intelligence
Forgetting fragments from evolving ontologies
ISWC'10 Proceedings of the 9th international semantic web conference on The semantic web - Volume Part I
Linkless normal form for ALC concepts and TBoxes
KI'11 Proceedings of the 34th Annual German conference on Advances in artificial intelligence
TrOWL: tractable OWL 2 reasoning infrastructure
ESWC'10 Proceedings of the 7th international conference on The Semantic Web: research and Applications - Volume Part II
Forgetting for defeasible logic
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Foundations for uniform interpolation and forgetting in expressive description logics
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
An on-line algorithm for semantic forgetting
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
Reasoning over ontologies with hidden content: the import-by-query approach
Journal of Artificial Intelligence Research
Model-theoretic inseparability and modularity of description logic ontologies
Artificial Intelligence
Hi-index | 0.00 |
Forgetting is an important tool for reducing ontologies by eliminating some concepts and roles while preserving sound and complete reasoning. Attempts have previously been made to address the problem of forgetting in relatively simple description logics (DLs) such as DL-Lite and extended ${\mathcal {EL}}$. The ontologies used in these attempts were mostly restricted to TBoxes rather than general knowledge bases (KBs). However, the issue of forgetting for general KBs in more expressive description logics, such as ${\mathcal {ALC}}$ and OWL DL, is largely unexplored. In particular, the problem of characterizing and computing forgetting for such logics is still open. In this paper, we first define semantic forgetting about concepts and roles in ${\mathcal {ALC}}$ ontologies and state several important properties of forgetting in this setting. We then define the result of forgetting for concept descriptions in ${\mathcal {ALC}}$, state the properties of forgetting for concept descriptions, and present algorithms for computing the result of forgetting for concept descriptions. Unlike the case of DL-Lite, the result of forgetting for an ${\mathcal {ALC}}$ ontology does not exist in general, even for the special case of concept forgetting. This makes the problem of how to compute forgetting in ${\mathcal {ALC}}$ more challenging. We address this problem by defining a series of approximations to the result of forgetting for ${\mathcal {ALC}}$ ontologies and studying their properties and their application to reasoning tasks. We use the algorithms for computing forgetting for concept descriptions to compute these approximations. Our algorithms for computing approximations can be embedded into an ontology editor to enhance its ability to manage and reason in (large) ontologies.