Skip to main content

Reasoning with the Depth-First Iterative Deepening Strategy in the DLog System

  • Conference paper
On the Move to Meaningful Internet Systems: OTM 2011 Workshops (OTM 2011)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 7046))

  • 1214 Accesses

Abstract

We propose an extension to the DLog system, which is a resolution-based ABox reasoner for the \(\mathcal{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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Baader, F., McGuinness, D.L., Nardi, D., Patel-Schneider, P.F. (eds.): The Description Logic Handbook: Theory, implementation, and applications. Cambridge University Press, Cambridge (2003)

    MATH  Google Scholar 

  2. Bechhofer, S., Horrocks, I., Turi, D.: The OWL Instance Store: System Description. In: Nieuwenhuis, R. (ed.) CADE 2005. LNCS (LNAI), vol. 3632, pp. 177–181. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  3. Glimm, B., Horrocks, I., Lutz, C., Sattler, U.: Conjunctive Query Answering for the Description Logic \(\mathcal{SHIQ}\). In: Veloso, M.M. (ed.) IJCAI 2007, pp. 399–404 (2007)

    Google Scholar 

  4. Guo, Y., Pan, Z., Heflin, J.: An Evaluation of Knowledge Base Systems for Large OWL Datasets. In: McIlraith, S.A., Plexousakis, D., van Harmelen, F. (eds.) ISWC 2004. LNCS, vol. 3298, pp. 274–288. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  5. Hustadt, U., Motik, B., Sattler, U.: Data Complexity in Very Expressive Description Logics. In: Proc. of the Nineteenth International Joint Conference on Artificial Intelligence, pp. 466–471 (2005)

    Google Scholar 

  6. Korf, R.E.: Depth-first iterative-deepening: an optimal admissible tree search. Artificial Intelligence 27, 97–109 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  7. Liang, S., Fodor, P., Wan, H., Kifer, M.: OpenRuleBench: An Analysis of the Performance of Rule Engines. In: Proc. of the 18th International Conference on World Wide Web, pp. 601–610. ACM, New York (2009)

    Chapter  Google Scholar 

  8. Liang, S., Fodor, P., Wan, H., Kifer, M.: OpenRuleBench: Detailed Report. Department of Computer Science State University of New York, May 29 (2009)

    Google Scholar 

  9. Lukácsy, G., Szeredi, P.: Efficient description logic reasoning in Prolog: The DLog system. Theory Pract. Logic Program. 9(3), 343–414 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  10. Meissner, A.: Introducing Parallel Computations to a PTTP-based First-Order Reasoning Process in the Oz Language. In: Darzentas, J., Vouros, G.A., Vosinakis, S., Arnellos, A. (eds.) SETN 2008. LNCS (LNAI), vol. 5138, pp. 359–364. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  11. Meissner, A.: A Simple Parallel Reasoning System for the \(\mathcal{ALC}\) Description Logic. In: Nguyen, N.T., Kowalczyk, R., Chen, S.-M. (eds.) ICCCI 2009. LNCS (LNAI), vol. 5796, pp. 413–424. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  12. Meissner, A., Brzykcy, G.: A Parallel Deduction for Description Logics with \(\mathcal{ALC}\) Language. In: Cotta, C., et al. (eds.) Knowledge-Driven Computing. SCI, vol. 102, pp. 149–164. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  13. Motik, B.: Reasoning in Description Logics using Resolution and Deductive Databases, PhD thesis. University of Karlsruhe (2006)

    Google Scholar 

  14. Nilsson, U., Małuszyński, J.: Logic, Programming and Prolog, 2nd edn. John Wiley & Sons Ltd. (1995)

    Google Scholar 

  15. Poggi, A., Lembo, D., Calvanese, D., De Giacomo, G., Lenzerini, M., Rosati, R.: Linking Data to Ontologies. In: Spaccapietra, S. (ed.) Journal on Data Semantics X. LNCS, vol. 4900, pp. 133–173. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  16. Stickel, M.: A Prolog Technology Theorem Prover: A New Exposition and Implementation in Prolog. SRI Int. Menlo Park. Technical Note 464 (1989)

    Google Scholar 

  17. Swift, T., Warren, D.: An abstract machine for SLG resolution: Definite programs. In: Proc. of the International Symposium on Logic Programming. MIT Press, Cambridge (1994)

    Google Scholar 

  18. Wielemaker, J.: SWI-Prolog 5.8 Reference Manual. Univ. of Amsterdam (2010)

    Google Scholar 

  19. XSB System, http://xsb.sourceforge.net/

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Meissner, A., Brzykcy, G. (2011). Reasoning with the Depth-First Iterative Deepening Strategy in the DLog System. In: Meersman, R., Dillon, T., Herrero, P. (eds) On the Move to Meaningful Internet Systems: OTM 2011 Workshops. OTM 2011. Lecture Notes in Computer Science, vol 7046. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25126-9_62

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-25126-9_62

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-25125-2

  • Online ISBN: 978-3-642-25126-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics