Towards Practical Uniform Interpolation and Forgetting for ALC TBoxes

From International Center for Computational Logic

Toggle side column

Towards Practical Uniform Interpolation and Forgetting for ALC TBoxes

Michel LudwigMichel Ludwig,  Boris KonevBoris Konev
Michel Ludwig, Boris Konev
Towards Practical Uniform Interpolation and Forgetting for ALC TBoxes
Proceedings of the 26th International Workshop on Description Logics (DL-2013), volume 1014 of CEUR-WS, 377-389, 2013
  • KurzfassungAbstract
    We develop a clausal resolution-based approach for computing uniform interpolants of TBoxes formulated in the description logic ALC when such uniform interpolants exist. We also present an experimental evaluation of our approach and its applications to concept forgetting, ontology obfuscation and logical difference on real-life $mathcal{ALC}$ ontologies. Our results indicate that in many practical cases a uniform interpolant exists and can be computed with the presented algorithm.
  • Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory
@inproceedings{ LuKo-DL-2013,
  author = {Michel {Ludwig} and Boris {Konev}},
  booktitle = {Proceedings of the 26th International Workshop on Description Logics ({DL-2013})},
  pages = {377--389},
  series = {CEUR-WS},
  title = {Towards Practical Uniform Interpolation and Forgetting for~$\mathcal{ALC}$ TBoxes},
  venue = {Ulm, Germany},
  volume = {1014},
  year = {2013},
}