Building an Efficient OWL 2 DL Reasoner

1 pages•Published: August 19, 2013

Abstract

The Ontology Web Language (OWL) has received considerable traction recently and is used in a number of industrial and practical applications. While decidable, all basic reasoning tasks for OWL are intractable (most of them are N2ExpTime-complete). Thus, in order to obtain a system capable of solving practically-relevant nontrivial problems, a number of theoretical and practical issues need to be resolved. In my talk I will present an overview of the techniques employed in HermiT, a state-of-the-art OWL reasoner developed at Oxford University. I will present the main ideas behind the hypertableau calculus and contrast them with the tableau calculi used in similar systems. Furthermore, I will discuss optimization techniques used in HermiT such as the blocking cache, individual reuse, and core blocking. Finally, I will discuss certain higher-level optimizations implemented on top of the basic calculus, such as the recently-developed optimized classification algorithm.

Keyphrases: automated reasoning, hermit, ontology, owl, tableau

In: Pascal Fontaine, Renate A. Schmidt and Stephan Schulz (editors). PAAR-2012. Third Workshop on Practical Aspects of Automated Reasoning, vol 21, pages 2.

Links:	https://easychair.org/publications/paper/TpRt
	https://doi.org/10.29007/57lg

BibTeX entry

@inproceedings{PAAR-2012:Building_Efficient_OWL_2,
  author    = {Boris Motik},
  title     = {Building an Efficient OWL 2 DL Reasoner},
  booktitle = {PAAR-2012. Third Workshop on Practical Aspects of Automated Reasoning},
  editor    = {Pascal Fontaine and Renate A. Schmidt and Stephan Schulz},
  series    = {EPiC Series in Computing},
  volume    = {21},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/TpRt},
  doi       = {10.29007/57lg},
  pages     = {2},
  year      = {2013}}

Download PDF Open PDF in browser