A Practical Acyclicity Notion for Query Answering Over Horn-\(\mathcal {SRIQ}\) Ontologies

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9981)

Abstract

Conjunctive query answering over expressive Horn Description Logic ontologies is a relevant and challenging problem which, in some cases, can be addressed by application of the chase algorithm. In this paper, we define a novel acyclicity notion which provides a sufficient condition for termination of the restricted chase over Horn- \(\mathcal {SRIQ}\) TBoxes. We show that this notion generalizes most of the existing acyclicity conditions (both theoretically and empirically). Furthermore, this new acyclicity notion gives rise to a very efficient reasoning procedure. We provide evidence for this by providing a materialization based reasoner for acyclic ontologies which outperforms other state-of-the-art systems.

Notes

Acknowledgements

We wish to thank Bernardo Cuenca Grau for extensive discussions on the subject and valuable feedback. This work was supported by the National Science Foundation under awards 1017255 III: Small: TROn – Tractable Reasoning with Ontologies and 1440202 EarthCube Building Blocks: Collaborative Proposal: GeoLink – Leveraging Semantics and Linked Data for Data Sharing and Discovery in the Geosciences; the ERC grant 647289 and the European Research Council grant CODA 647289.

References

  1. 1.
    Baader, F., Calvanese, D., McGuinness, D., Nardi, D., Patel-Schneider, P. (eds.): The Description Logic Handbook: Theory, Implementation, and Applications, 2nd edn. Cambridge University Press, New York (2007)MATHGoogle Scholar
  2. 2.
    Baget, J., Garreau, F., Mugnier, M., Rocher, S.: Extending acyclicity notions for existential rules. In: ECAI 2014, Frontiers in Artificial Intelligence and Applications, vol. 263, pp. 39–44. IOS Press (2014)Google Scholar
  3. 3.
    Calì, A., Gottlob, G., Kifer, M.: Taming the infinite chase. In: Brewka, G., Lang, J. (eds.) Proceedings of 11th International Conference on Principles of Knowledge Representation and Reasoning (KR 2008), pp. 70–80. AAAI Press (2008)Google Scholar
  4. 4.
    Calvanese, D., Eiter, T., Ortiz, M.: Answering regular path queries in expressive dls via alternating tree-automata. Inf. Comput. 237, 12–55 (2014)MathSciNetCrossRefMATHGoogle Scholar
  5. 5.
    Carral Martínez, D., Hitzler, P.: Extending description logic rules. In: Simperl, E., Cimiano, P., Polleres, A., Corcho, O., Presutti, V. (eds.) ESWC 2012. LNCS, vol. 7295, pp. 345–359. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  6. 6.
    Grau, B.C., Horrocks, I., Krötzsch, M., Kupke, C., Magka, D., Motik, B., Wang, Z.: Acyclicity notions for existential rules and their application to query answering in ontologies. JAIR 47, 741–808 (2013)MathSciNetMATHGoogle Scholar
  7. 7.
    Fagin, R., Kolaitis, P.G., Miller, R.J., Popa, L.: Data exchange: semantics and query answering. Theor. Comput. Sci. 336(1), 89–124 (2005)MathSciNetCrossRefMATHGoogle Scholar
  8. 8.
    Glimm, B., Lutz, C., Horrocks, I., Sattler, U.: Conjunctive query answering for the description logic SHIQ. J. Artif. Intell. Res. (JAIR) 31, 157–204 (2008)MathSciNetMATHGoogle Scholar
  9. 9.
    Hitzler, P., Krötzsch, M., Parsia, B., Patel-Schneider, P.F., Rudolph, S. (eds.): OWL 2 Web Ontology Language: Primer. W3C Recommendation (27 October 2009). http://www.w3.org/TR/owl2-primer/
  10. 10.
    Horrocks, I., Kutz, O., Sattler, U.: The even more irresistible SROIQ. In: Proceedings, Tenth International Conference on Principles of Knowledge Representation and Reasoning, United Kingdom, June 2–5, 2006, pp. 57–67. AAAI Press (2006)Google Scholar
  11. 11.
    Kontchakov, R., Lutz, C., Toman, D., Wolter, F., Zakharyaschev, M.: The combined approach to query answering in dl-lite. In: Lin, F., Sattler, U., Truszczynski, M. (eds.) KR 2010. AAAI Press (2010)Google Scholar
  12. 12.
    Krötzsch, M., Rudolph, S.: Extending decidable existential rules by joining acyclicity and guardedness. In: IJCAI, pp. 963–968 (2011)Google Scholar
  13. 13.
    Krötzsch, M., Rudolph, S., Hitzler, P.: Complexities of horn description logics. ACM Trans. Comp. Log. 14(1), 2:1–2:36 (2013)MathSciNetMATHGoogle Scholar
  14. 14.
    Marnette, B.: Generalized schema-mappings: from termination to tractability. In: PODS, pp. 13–22 (2009)Google Scholar
  15. 15.
    Nenov, Y., Piro, R., Motik, B., Horrocks, I., Wu, Z., Banerjee, J.: RDFox: a highly-scalable RDF store. In: Arenas, M., et al. (eds.) ISWC 2015. LNCS, vol. 9367, pp. 3–20. Springer, Heidelberg (2015). doi: 10.1007/978-3-319-25010-6_1 CrossRefGoogle Scholar
  16. 16.
    Rudolph, S., Glimm, B.: Nominals, inverses, counting, and conjunctive queries or: Why infinity is your friend! CoRR abs/1401.3849 (2014)Google Scholar
  17. 17.
    Stefanoni, G., Motik, B., Horrocks, I.: Introducing nominals to the combined query answering approaches for \(\cal EL\). In: AAAI (2013)Google Scholar
  18. 18.
    Stefanoni, G., Motik, B., Krötzsch, M., Rudolph, S.: The complexity of answering conjunctive and navigational queries over OWL 2 EL knowledge bases. J. Artif. Intell. Res. (JAIR) 51, 645–705 (2014)MathSciNetMATHGoogle Scholar
  19. 19.
    Steigmiller, A., Liebig, T., Glimm, B.: Konclude: system description. J. Web Sem. 27, 78–85 (2014)CrossRefMATHGoogle Scholar
  20. 20.
    Zhou, Y., Grau, B.C., Nenov, Y., Kaminski, M., Horrocks, I.: Pagoda: pay-as-you-go ontology query answering with a datalog reasoner. J. Artif. Intell. Res. (JAIR) 54, 309–367 (2015)MathSciNetMATHGoogle Scholar

Copyright information

© Springer International Publishing AG 2016

Authors and Affiliations

  1. 1.DaSe LabWright State UniversityDaytonUSA
  2. 2.Universität BremenBremenGermany

Personalised recommendations