@INPROCEEDINGS{KoopmannSchmidt15a,
AUTHOR = {Koopmann, P. and Schmidt, R. A.},
YEAR = {2015},
TITLE = {Uniform Interpolation and Forgetting for {$\mathcal{ALC}$} Ontologies with ABoxes},
EDITOR = {Bonet, B. and Koenig, S.},
BOOKTITLE = {Proc.\ AAAI-2015},
PUBLISHER = {AAAI Press},
PAGES = {175--181},
URL = {http://www.aaai.org/ocs/index.php/AAAI/AAAI15/paper/view/9981},
ISBN = {978-1-57735-698-1},
ABSTRACT = {
Uniform interpolation and the dual task of forgetting restrict
the ontology to a specified subset of concept and role names.
This makes them useful tools for ontology analysis, ontology
evolution and information hiding. Most previous research
focused on uniform interpolation of TBoxes. However,
especially for applications in privacy and information
hiding, it is essential that uniform interpolation methods can
deal with ABoxes as well. We present the first method that
can compute uniform interpolants of any ALC ontology with
ABoxes. ABoxes bring their own challenges when computing
uniform interpolants, possibly requiring disjunctive statements
or nominals in the resulting ABox. Our method can
compute representations of uniform interpolants in ALCO.
An evaluation on realistic ontologies shows that these uniform
interpolants can be practically computed, and can often
even be presented in pure ALC.
}
}