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
Forgetting in Managing Rules and Ontologies
WI '06 Proceedings of the 2006 IEEE/WIC/ACM International Conference on Web Intelligence
Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family
Journal of Automated Reasoning
On the update of description logic ontologies at the instance level
AAAI'06 proceedings of the 21st national conference on Artificial intelligence - Volume 2
Forgetting and conflict resolving in disjunctive logic programming
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
DL-Lite: tractable description logics for ontologies
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
A theory of forgetting in logic programming
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
On the approximation of instance level update and erasure in description logics
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
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
Formal Properties of Modularisation
Modular Ontologies
Abstract ERIA: a web language for conceptual metadata integration and abstraction in the large
Proceedings of the International Conference on Management of Emergent Digital EcoSystems
Model-based revision operators for terminologies in description logics
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Concept and Role Forgetting in ${\mathcal {ALC}}$ Ontologies
ISWC '09 Proceedings of the 8th International Semantic Web Conference
Uniform Interpolation for $\mathcal{ALC}$ Revisited
AI '09 Proceedings of the 22nd Australasian Joint Conference on Advances in Artificial Intelligence
The DL-lite family and relations
Journal of Artificial Intelligence Research
Logic-based ontology comparison and module extraction, with an application to DL-Lite
Artificial Intelligence
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
Aggregated search of data and services
Information Systems
Forgetting fragments from evolving ontologies
ISWC'10 Proceedings of the 9th international semantic web conference on The semantic web - Volume Part I
Interpolation theorems for some extended description logics
KES'11 Proceedings of the 15th international conference on Knowledge-based and intelligent information and engineering systems - Volume Part II
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
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
Utility-driven evolution recommender for a constrained ontology
Proceedings of the 3rd International Conference on Web Intelligence, Mining and Semantics
Hi-index | 0.00 |
To support the reuse and combination of ontologies in Semantic Web applications, it is often necessary to obtain smaller ontologies from existing larger ontologies. In particular, applications may require the omission of many terms, e.g., concept names and role names, from an ontology. However, the task of omitting terms from an ontology is challenging because the omission of some terms may affect the relationships between the remaining terms in complex ways. We present the first solution to this problem by adapting the technique of forgetting, previously used in other domains. Specifically, we present a semantic definition of forgetting for description logics in general, which generalizes the standard definition for classical logic. We then introduce algorithms that implement forgetting in both DL-Lite TBoxes and ABoxes, and in DL-Lite knowledge bases. We prove that the algorithms are correct with respect to the semantic definition of forgetting, and that they run in polynomial time.