A Modularization-based Approach to Finding All Justifications for OWL DL Entailments

Boontawee SuntisrivarapornBoontawee Suntisrivaraporn, Guilin QiGuilin Qi, Qiu JiQiu Ji, Peter HaasePeter Haase

Download

Boontawee Suntisrivaraporn, Guilin Qi, Qiu Ji, Peter Haase
A Modularization-based Approach to Finding All Justifications for OWL DL Entailments
In John Domingue and Chutiporn Anutariya, eds., Proceedings of the 3th Asian Semantic Web Conference (ASWC'08), volume 5367 of Lecture Notes in Computer Science, 1-15, 2008. Springer

Details
Bibtex

KurzfassungAbstract
Finding the justifications for an entailment (i.e., minimal sets of axioms responsible for it) is a prominent reasoning service in ontology engineering, as justifications facilitate important tasks like debugging inconsistencies or undesired subsumption. Though several algorithms for finding all justifications exist, issues concerning efficiency and scalability remain a challenge due to the sheer size of real-life ontologies. In this paper, we propose a novel method for finding all justifications in OWL DL ontologies by limiting the search space to smaller modules. To this end, we show that so-called locality-based modules cover all axioms in the justifications. We present empirical results that demonstrate an improvement of several orders of magnitude in efficiency and scalability of finding all justifications in OWL DL ontologies.
Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory

The final publication is available at Springer.

@inproceedings{ SunEtAl-ASWC-08,
  author = {Boontawee {Suntisrivaraporn} and Guilin {Qi} and Qiu {Ji} and Peter {Haase}},
  booktitle = {Proceedings of the 3th Asian Semantic Web Conference ({ASWC'08})},
  editor = {John {Domingue} and Chutiporn {Anutariya}},
  pages = {1--15},
  publisher = {Springer-Verlag},
  series = {Lecture Notes in Computer Science},
  title = {A Modularization-based Approach to Finding All Justifications for OWL DL Entailments},
  volume = {5367},
  year = {2008},
}