Reasoning with the depth-first iterative deepening strategy in the DLog system

  • Authors:

  • Adam Meissner;Grażyna Brzykcy

  • Affiliations:

  • Institute of Control and Information Engineering, Poznań University of Technology, Poznań, Poland;Institute of Control and Information Engineering, Poznań University of Technology, Poznań, Poland

  • Venue:
  • OTM'11 Proceedings of the 2011th Confederated international conference on On the move to meaningful internet systems
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

We propose an extension to the DLog system, which is a resolution-based ABox reasoner for the SHIQ description logic, particularly intended for instance checking and instance retrieval. We replace the original search strategy of the derivation tree, namely the depth-first search, by the depth-first iterative deepening search. The latter approach is proven to be asymptotically optimal among brute-force strategies in terms of proof length, space and time. The extension leads to shorter proofs and, on average, to better timing results when it is enough to compute one positive answer to the given query. We compare the performance of the original and the extended version of the DLog system on a simple benchmark set.