Skip to main content
SpringerLink
Log in

Distributed Reasoning for Restricted Weakly-Linear Disjunctive Tuple-Generating Dependencies

  • Conference paper
  • First Online:
Rules and Reasoning (RuleML+RR 2020)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 12173))

Included in the following conference series:

  • 423 Accesses

Abstract

We study the problem of distributed reasoning over connected database components with a class of ontologies based on disjunctive tuple-generating dependencies, called restricted weakly-linear disjunctive tuple-generating dependencies. This language extends linear tuple-generating dependencies as well as linear disjunctive Datalog. We provide the first distributability results on these queries and report experimental results on real-world ontology benchmark suites.

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.

    Our version of transformation \(\mathrm \Xi \) is slightly different from that of [13] to make it work for our problem of deciding distribution over components. The details can be found in the full report of this work.

  2. 2.

    Guardedness here refers to the given DTGDs.

  3. 3.

    We refer to [12] for details on this standard normalization procedure. Our normalized forms follow their Table 1, but with an additional form \(A_1\sqcap \dots \sqcap A_n\sqsubseteq B_1\sqcup \dots \sqcup B_m\).

References

  1. Ahmetaj, S., Ortiz, M., Simkus, M.: Rewriting guarded existential rules into small datalog programs. In: Proceedings of the ICDT-18 (2018)

    Google Scholar 

  2. Ameloot, T.J., Ketsman, B., Neven, F., Zinn, D.: Datalog queries distributing over components. ACM Trans. Comput. Logic (TOCL) 18(1), 5 (2017)

    Article  MathSciNet  Google Scholar 

  3. Baget, J.-F.: Improving the forward chaining algorithm for conceptual graphs rules. In: Proceedings of the KR-04, vol. 4, pp. 407–414 (2004)

    Google Scholar 

  4. Baget, J.-F., Leclère, M., Mugnier, M.-L., Rocher, S., Sipieter, C.: Graal: a toolkit for query answering with existential rules. In: Bassiliades, N., Gottlob, G., Sadri, F., Paschke, A., Roman, D. (eds.) RuleML 2015. LNCS, vol. 9202, pp. 328–344. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-21542-6_21

    Chapter  Google Scholar 

  5. Bárány, V., Ten Cate, B., Segoufin, L.: Guarded negation. J. ACM 62(3), 22 (2015)

    Article  MathSciNet  Google Scholar 

  6. Berger, G., Pieris, A.: Ontology-mediated queries distributing over components. In: Proceedings of the IJCAI 2016, pp. 943–949 (2016)

    Google Scholar 

  7. Bienvenu, M., Ten Cate, B., Lutz, C., Wolter, F.: Ontology-based data access: a study through disjunctive datalog, CSP, and MMSNP. ACM TODS 39(4), 33 (2014)

    Article  MathSciNet  Google Scholar 

  8. Bourhis, P., Manna, M., Morak, M., Pieris, A.: Guarded-based disjunctive tuple-generating dependencies. ACM TODS 41(4), 27 (2016)

    Article  MathSciNet  Google Scholar 

  9. Fagin, R., Kolaitis, P.G., Miller, R.J., Popa, L.: Data exchange: semantics and query answering. In: Calvanese, D., Lenzerini, M., Motwani, R. (eds.) ICDT 2003. LNCS, vol. 2572, pp. 207–224. Springer, Heidelberg (2003). https://doi.org/10.1007/3-540-36285-1_14

    Chapter  Google Scholar 

  10. Gottlob, G., Leone, N., Scarcello, F.: The complexity of acyclic conjunctive queries. J. ACM 48(3), 431–498 (2001)

    Article  MathSciNet  Google Scholar 

  11. Gottlob, G., Manna, M., Morak, M., Pieris, A.: On the complexity of ontological reasoning under disjunctive existential rules. In: Rovan, B., Sassone, V., Widmayer, P. (eds.) MFCS 2012. LNCS, vol. 7464, pp. 1–18. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-32589-2_1

    Chapter  MATH  Google Scholar 

  12. Grau, B.C., Motik, B., Stoilos, G., Horrocks, I.: Computing datalog rewritings beyond horn ontologies. In: Proceedings of the AAAI 2013 (2013)

    Google Scholar 

  13. Kaminski, M., Nenov, Y., Grau, B.C.: Datalog rewritability of disjunctive datalog programs and its applications to ontology reasoning. In: Proceedings of the AAAI 2014 (2014)

    Google Scholar 

  14. König, M., Leclère, M., Mugnier, M.-L., Thomazo, M.: Sound, complete and minimal UCQ-rewriting for existential rules. Semant. Web 6(5), 451–475 (2015)

    Article  Google Scholar 

  15. Lutz, C., Seylan, İ., Toman, D., Wolter, F.: The combined approach to OBDA: taming role hierarchies using filters. In: Alani, H., et al. (eds.) ISWC 2013. LNCS, vol. 8218, pp. 314–330. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-41335-3_20

    Chapter  Google Scholar 

  16. Matentzoglu, N., Parsia, B.: The Manchester OWL Corpus (MOWLCorp), original serialisation, July 2014

    Google Scholar 

  17. Motik, B., Nenov, Y., Piro, R., Horrocks, I., Olteanu, D.: Parallel materialisation of datalog programs in centralised, main-memory RDF systems. In: AAAI 2014 (2014)

    Google Scholar 

  18. Smith, B., et al.: The OBO foundry: coordinated evolution of ontologies to support biomedical data integration. Nat. Biotechnol. 25(11), 1251 (2007)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Alberta, Edmonton, AB, Canada

    Arash Karimi & Jia-Huai You

Authors
  1. Arash Karimi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jia-Huai You
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Arash Karimi .

Editor information

Editors and Affiliations

  1. School of Computer Science and Informatics, Cardiff University, Cardiff, UK

    Víctor Gutiérrez-Basulto

  2. University of Economics, Prague, Prague, Czech Republic

    Tomáš Kliegr

  3. Norwegian University of Science and Technology, Gjøvik, Norway

    Ahmet Soylu

  4. Department Of Informatics, University of Oslo, Oslo, Norway

    Martin Giese

  5. SINTEF AS, Oslo, Norway

    Dumitru Roman

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Karimi, A., You, JH. (2020). Distributed Reasoning for Restricted Weakly-Linear Disjunctive Tuple-Generating Dependencies. In: Gutiérrez-Basulto, V., Kliegr, T., Soylu, A., Giese, M., Roman, D. (eds) Rules and Reasoning. RuleML+RR 2020. Lecture Notes in Computer Science(), vol 12173. Springer, Cham. https://doi.org/10.1007/978-3-030-57977-7_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-57977-7_10

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-57976-0

  • Online ISBN: 978-3-030-57977-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation