@INPROCEEDINGS{ZhaoSchmidt15b,
AUTHOR = {Zhao, Y. and Schmidt, R. A.},
YEAR = {2015},
TITLE = {Concept Forgetting in ALCOI-Ontologies Using an Ackermann Approach},
EDITOR = {Arenas, M. and Corcho, O. and Simperl, E. and Strohmaier, M. and d'Aquin, M. and Srinivas, K. and Groth, P. T. and Dumontier, M. and Heflin, J. and Thirunarayan, K. and Staab, S.},
BOOKTITLE = {The Semantic Web, 14th International Semantic Web Conference, ISWC 2015},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {9366},
PUBLISHER = {Springer},
PAGES = {587--602},
DOI = {http://dx.doi.org/10.1007/978-3-319-25007-6_34},
URL = {http://www.cs.man.ac.uk/~schmidt/publications/ZhaoSchmidt15b.html},
ABSTRACT = {We present a method for forgetting concept symbols in ontologies
specified in the description logic ALCOI. The method is an
adaptation and improvement of a second-order quantifier elimination
method developed for modal logics and used for computing correspondence
properties for modal axioms. It follows an approach exploiting a
result of Ackermann adapted to description logics. An important feature
inherited from the modal approach is that the inference rules are guided
by an ordering compatible with the elimination order of the concept symbols.
This provides more control over the inference process and reduces
non-determinism, resulting in a smaller search space. The method is extended
with a new case splitting inference rule, and several simplification
rules. Compared to related forgetting and uniform interpolation methods
for description logics, the method can handle inverse roles, nominals and
ABoxes. Compared to the modal approach on which it is based, it is more
efficient in time and improves the success rates. The method has been
implemented in Java using the OWL API. Experimental results show
that the order in which the concept symbols are eliminated significantly
affects the success rate and efficiency.
}
}