Tableau-based Forgetting in ALC Ontologies

Authors:
Zhe Wang;Kewen Wang;Rodney Topor;Xiaowang Zhang
Affiliations:
Griffith University, Australia, {jack.wang,k.wang,r.topor}@griffith.edu.au;Griffith University, Australia, {jack.wang,k.wang,r.topor}@griffith.edu.au;Griffith University, Australia, {jack.wang,k.wang,r.topor}@griffith.edu.au;Peking University, China, zxw@is.pku.edu.cn
Venue:
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Year:
2010

Citing 8
Cited 2

The Description Logic Handbook

The Description Logic Handbook
Optimizing Terminological Reasoning for Expressive Description Logics

Journal of Automated Reasoning
Semantic forgetting in answer set programming

Artificial Intelligence
Propositional independence: formula-variable independence and forgetting

Journal of Artificial Intelligence Research
A tableaux-based method for computing least common subsumers for expressive description logics

IJCAI'09 Proceedings of the 21st international jont 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
Concept and Role Forgetting in ${\mathcal {ALC}}$ Ontologies

ISWC '09 Proceedings of the 8th International Semantic Web Conference
Forgetting concepts in DL-lite

ESWC'08 Proceedings of the 5th European semantic web conference on The semantic web: research and applications

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
Reasoning over ontologies with hidden content: the import-by-query approach

Journal of Artificial Intelligence Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose two new approaches to forgetting for ALC based on the well-known tableau algorithm. The first approach computes the result of forgetting by rolling up tableaux, and also provides a decision algorithm for the existence of forgetting in ALC. When the result of forgetting does not exist, we provide an incremental method for computing approximations of forgetting. This second approach uses variable substitution to refine approximations of forgetting and eventually obtain the result of forgetting. This approach is capable of preserving structural information of the original ontologies enabling readability and comparison. As both approaches are based on the tableau algorithm, their implementations can make use of the mechanisms and optimization techniques of existing description logic reasoners.