Skip to main content
SpringerLink
Log in

On the Complexity of Evaluating Regular Path Queries over Linear Existential Rules

  • Conference paper
  • First Online:
Book cover Web Reasoning and Rule Systems (RR 2016)

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

Included in the following conference series:

Abstract

In the setting of ontology-mediated query answering, a query is evaluated over a knowledge base consisting of a database instance and an ontology. While most work in the area focuses on conjunctive queries, navigational queries are gaining increasing attention. In this paper, we investigate the complexity of evaluating the standard form of navigational queries, namely two-way regular path queries, over knowledge bases whose ontology is expressed by means of linear existential rules. More specifically, we show how to extend an approach developed for DL-Lite\(_\mathcal {R}\) to obtain an exponential-time decision procedure for linear rules. We prove that this algorithm achieves optimal worst-case complexity by establishing a matching ExpTime lower bound.

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

Access this chapter

Log in via an institution
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 EPUB and 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

Notes

  1. 1.

    As we only consider the two-way variant, we will use the abbreviation RPQ instead of the more traditional 2RPQ.

  2. 2.

    Note that x is required to determine the arity of \(\textit{conf}\).

References

  1. Baget, J., Leclère, M., Mugnier, M., Salvat, E.: Extending decidable cases for rules with existential variables. In: Proceedings of IJCAI, pp. 677–682 (2009)

    Google Scholar 

  2. Baget, J., Bienvenu, M., Mugnier, M., Rocher, S.: Combining existential rules and transitivity: next steps. In: Proceedings of IJCAI, pp. 2720–2726 (2015)

    Google Scholar 

  3. Bienvenu, M., Calvanese, D., Ortiz, M., Šimkus, M.: Nested regular path queries in description logics. In: Proceedings of KR (2014)

    Google Scholar 

  4. Bienvenu, M., Ortiz, M.: Ontology-mediated query answering with data-tractable description logics. In: Faber, W., Paschke, A. (eds.) Reasoning Web 2015. LNCS, vol. 9203, pp. 218–307. Springer, Heidelberg (2015)

    Chapter  Google Scholar 

  5. Bienvenu, M., Ortiz, M., Simkus, M.: Regular path queries in lightweight description logics: complexity and algorithms. J. Artif. Intell. Res. (JAIR) 53, 315–374 (2015)

    MathSciNet  MATH  Google Scholar 

  6. Bourhis, P., Krötzsch, M., Rudolph, S.: How to best nest regular path queries. In: Proceedings of DL, pp. 404–415 (2014)

    Google Scholar 

  7. Calì, A., Gottlob, G., Kifer, M.: Taming the infinite chase: query answering under expressive relational constraints. In: Proceedings of KR, pp. 70–80 (2008)

    Google Scholar 

  8. Calvanese, D., Eiter, T., Ortiz, M.: Answering regular path queries in expressive description logics: an automata-theoretic approach. In: Proceedings of AAAI, pp. 391–396 (2007)

    Google Scholar 

  9. Calvanese, D., Eiter, T., Ortiz, M.: Regular path queries in expressive description logics with nominals. In: Proceedings of IJCAI, pp. 714–720 (2009)

    Google Scholar 

  10. Calvanese, D., Eiter, T., Ortiz, M.: Answering regular path queries in expressive description logics via alternating tree-automata. Inf. Comput. 237, 12–55 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  11. Florescu, D., Levy, A., Suciu, D.: Query containment for conjunctive queries with regular expressions. In: Proceedings of PODS (1998)

    Google Scholar 

  12. Gottlob, G., Papadimitriou, C.H.: On the complexity of single-rule datalog queries. Inf. Comput. 183(1), 104–122 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  13. 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. J. Artif. Intell. Res. (JAIR) 47, 741–808 (2013)

    MathSciNet  MATH  Google Scholar 

  14. Johnson, D.S., Klug, A.C.: Testing containment of conjunctive queries under functional and inclusion dependencies. J. Comput. Syst. Sci. 28(1), 167–189 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  15. Kostylev, E.V., Reutter, J.L., Vrgoc, D.: XPath for DL ontologies. In: Proceedings of AAAI (2015)

    Google Scholar 

  16. Maier, D., Mendelzon, A.O., Sagiv, Y.: Testing implications of data dependencies. ACM Trans. Database Syst. 4(4), 455–469 (1979)

    Article  Google Scholar 

  17. Marnette, B.: Generalized schema-mappings: from termination to tractability. In: Proceedings of PODS, pp. 13–22 (2009)

    Google Scholar 

  18. Ortiz, M., Rudolph, S., Šimkus, M.: Query answering in the Horn fragments of the description logics \(\cal {SHOIQ}\) and \(\cal {SROIQ}\). In: Proceedings of IJCAI (2011)

    Google Scholar 

  19. 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)

    MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

This work was supported by the ANR project 12 JS02 007 01.

Author information

Authors and Affiliations

  1. CNRS, Université de Montpellier, Montpellier, France

    Meghyn Bienvenu

  2. Inria, Le Chesnay Cedex, France

    Meghyn Bienvenu & Michaël Thomazo

Authors
  1. Meghyn Bienvenu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michaël Thomazo
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Michaël Thomazo .

Editor information

Editors and Affiliations

  1. Vienna University of Technology , Vienna, Austria

    Magdalena Ortiz

  2. Computer Science, Vrije Universiteit Amsterdam, Amsterdam, Noord-Holland, The Netherlands

    Stefan Schlobach

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Bienvenu, M., Thomazo, M. (2016). On the Complexity of Evaluating Regular Path Queries over Linear Existential Rules. In: Ortiz, M., Schlobach, S. (eds) Web Reasoning and Rule Systems. RR 2016. Lecture Notes in Computer Science(), vol 9898. Springer, Cham. https://doi.org/10.1007/978-3-319-45276-0_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-45276-0_1

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-45275-3

  • Online ISBN: 978-3-319-45276-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation