Abstract
Warded Datalog+/– is a powerful member of the Datalog+/– family, which extends the logic language Datalog with existential quantification and provides full support for recursion. Such expressive power, paired with a promising trade-off with the offered data complexity, was the catalyst for the recent rise of the language as a relevant candidate for knowledge graph traversal and ontological reasoning applications. Despite the growing research and industrial interest towards Warded Datalog+/–, we observe a substantial lack of specific tools able to generate non-trivial settings and benchmark scenarios, essential to evaluate, analyze and compare reasoning systems over such tasks. In this paper, we aim at filling this gap by introducing iWarded, a versatile generator of Warded Datalog+/– benchmarks. Our system is able to efficiently create very large, complex, and realistic reasoning settings while providing extensive control over the theoretical underpinnings of the language. iWarded was developed and employed in the context of the Vadalog system, a state-of-the-art Warded Datalog+/—based reasoner.
Keywords
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases, vol. 8. Addison-Wesley Reading, Reading (1995)
Arocena, P.C., Glavic, B., Ciucanu, R., Miller, R.J.: The iBench integration metadata generator. VLDB Endow. 9(3), 108–119 (2015)
Atzeni, P., Baldazzi, T., Bellomarini, L., Sallinger, E.: iWarded. https://github.com/joint-kg-labs/iWarded (2022) . Accessed 23 June 2022
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
Baldazzi, T., Bellomarini, L., Favorito, M., Sallinger, E.: On the relationship between shy and warded datalog+/-. arXiv preprint arXiv:2202.06285 (2022)
Baldazzi, T., Bellomarini, L., Sallinger, E., Atzeni, P.: Eliminating harmful joins in warded datalog+/–. In: Moschoyiannis, S., Peñaloza, R., Vanthienen, J., Soylu, A., Roman, D. (eds.) RuleML+RR 2021. LNCS, vol. 12851, pp. 267–275. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-91167-6_18
Barceló, P., Pichler, R. (eds.): Datalog in academia and Industry. In: Second International Workshop, Datalog 2.0, Vienna, Austria, 11–13 September 2012. Proceedings, LNCS, vol. 7494. Springer (2012). https://doi.org/10.1007/978-3-642-32925-8
Barrett, C., et al.: The SMT-LIB standard: Version 2.0. In: Proceedings of the 8th International Workshop on Satisfiability Modulo Theories (Edinburgh, England). vol. 13, p. 14 (2010)
Bellomarini, L., Benedetto, D., Gottlob, G., Sallinger, E.: Vadalog: a modern architecture for automated reasoning with large knowledge graphs. Inf. Syst. IS (2020)
Bellomarini, L., Gottlob, G., Pieris, A., Sallinger, E.: Swift logic for big data and knowledge graphs. In: Tjoa, A.M., Bellatreche, L., Biffl, S., van Leeuwen, J., Wiedermann, J. (eds.) SOFSEM 2018. LNCS, vol. 10706, pp. 3–16. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-73117-9_1
Bellomarini, L., Sallinger, E., Gottlob, G.: The Vadalog system: datalog-based reasoning for knowledge graphs. VLDB Endow. 11(9) (2018)
Bellomarini, L., Sallinger, E., Vahdati, S.: Chapter 6 reasoning in knowledge graphs: an embeddings spotlight. In: Janev, V., Graux, D., Jabeen, H., Sallinger, E. (eds.) Knowledge Graphs and Big Data Processing. LNCS, vol. 12072, pp. 87–101. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-53199-7_6
Benedikt, M., et al.: Benchmarking the chase. In: PODS, pp. 37–52 (2017)
Benedikt, M., Leblay, J., Tsamoura, E.: PDQ: proof-driven query answering over web-based data. VLDB Endow. 7(13), 1553–1556 (2014)
Bonifati, A., Ileana, I., Linardi, M.: Functional dependencies unleashed for scalable data exchange. CoRR abs/1602.00563 (2016)
Calì, A., Gottlob, G., Kifer, M.: Taming the infinite chase: query answering under expressive relational constraints. J. Artif. Intell. Res. 48, 115–174 (2013)
Calì, A., Gottlob, G., Lukasiewicz, T.: A general datalog-based framework for tractable query answering over ontologies. J. Web Seman. 14, 57–83 (2012)
Calì, A., Gottlob, G., Lukasiewicz, T., Marnette, B., Pieris, A.: Datalog+/-: A family of logical knowledge representation and query languages for new applications. In: 2010 25th Annual IEEE Symposium on Logic in Computer Science (2010)
Calì, A., Gottlob, G., Pieris, A.: Towards more expressive ontology languages: the query answering problem. Artif. Intell. 193, 87–128 (2012)
Fagin, R., Kolaitis, P.G., Miller, R.J., Popa, L.: Data exchange: semantics and query answering. In: ICDT (2003)
Geerts, F., Mecca, G., Papotti, P., Santoro, D.: Mapping and cleaning. In: ICDE, pp. 232–243. IEEE Computer Society (2014)
Geerts, F., Mecca, G., Papotti, P., Santoro, D.: That’s all folks! llunatic goes open source. VLDB Endow. 7(13), 1565–1568 (2014)
Gottlob, G., Pieris, A.: Beyond SPARQL under OWL 2 QL entailment regime: Rules to the rescue. In: IJCAI (2015)
Gottlob, G., Pieris, A., Sallinger, E.: Vadalog: recent advances and applications. In: Calimeri, F., Leone, N., Manna, M. (eds.) JELIA 2019. LNCS (LNAI), vol. 11468, pp. 21–37. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-19570-0_2
Imprialou, M., Stoilos, G., Grau, B.C.: Benchmarking ontology-based query rewriting systems. In: Twenty-Sixth AAAI Conference on Artificial Intelligence (2012)
Konstantinidis, G., Ambite, J.L.: Optimizing the chase: scalable data integration under constraints. VLDB Endow. 7(14), 1869–1880 (2014)
Krötzsch, M., Thost, V.: Ontologies for knowledge graphs: breaking the rules. In: Groth, P., et al. (eds.) ISWC 2016. LNCS, vol. 9981, pp. 376–392. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-46523-4_23
Lanti, D., Rezk, M.I., Xiao, G., Calvanese, D.: The NPD benchmark: reality check for OBDA systems. In: Advances in database technology-EDBT 2015: 18th International Conference on Extending Database Technology. Brussels, Belgium, 23–27 March 2015, Proceedings, pp. 617–628. University of Konstanz, University Library (2015)
Leone, N., Manna, M., Terracina, G., Veltri, P.: Dlv\(^{\wedge {}}\)E system. https://www.mat.unical.it/dlve/ (2017). Accessed 23 June 2022
Leone, N., Manna, M., Terracina, G., Veltri, P.: Fast query answering over existential rules. ToCL 20(2), 1–48 (2019)
Leone, N., et al.: The dlv system for knowledge representation and reasoning. ACM Trans. Comput. Logic (TOCL) 7(3), 499–562 (2006)
Leone, N., et al.: The DLV system for knowledge representation and reasoning. ACM Trans. Comput. Log. 7(3), 499–562 (2006)
Leutenegger, S.T., Dias, D.: A modeling study of the TPC-C benchmark. ACM SIGMOD Rec. 22(2), 22–31 (1993)
Maier, D., Mendelzon, A.O., Sagiv, Y.: Testing implications of data dependencies. ACM Trans. Database Syst. 4(4), 455–469 (1979)
Menascé, D.A.: TPC-W: a benchmark for e-commerce. IEEE Internet Comput. 6(3), 83–87 (2002)
Motik, B., Nenov, Y., Piro, R., Horrocks, I., Olteanu, D.: Parallel materialisation of datalog programs in centralised, main-memory RDF systems. In: AAAI (2014)
Patterson, D.: Technical perspective for better or worse, benchmarks shape a field. Commun. ACM 55(7) (2012)
Poess, M., Floyd, C.: New TPC benchmarks for decision support and web commerce. ACM SIGMOD Rec. 29(4), 64–71 (2000)
Poess, M., Rabl, T., Jacobsen, H.A., Caufield, B.: TPC-DI: the first industry benchmark for data integration. PVLDB 7(13), 1367–1378 (2014)
Shkapsky, A., Yang, M., Zaniolo, C.: Optimizing recursive queries with monotonic aggregates in deals. In: 2015 IEEE 31st International Conference on Data Engineering, pp. 867–878. IEEE (2015)
Sutcliffe, G.: The TPTP problem library and associated infrastructure. J. Autom. Reason. 43(4), 337–362 (2009)
Zaniolo, C., Yang, M., Das, A., Shkapsky, A., Condie, T., Interlandi, M.: Fixpoint semantics and optimization of recursive datalog programs with aggregates. Theory Pract. Logic Program. 17(5–6), 1048–1065 (2017)
Acknowledgements
The work on this paper was partially supported by the Vienna Science and Technology Fund (WWTF) grant VRG18-013.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Atzeni, P., Baldazzi, T., Bellomarini, L., Sallinger, E. (2022). iWarded: A Versatile Generator to Benchmark Warded Datalog+/– Reasoning. In: Governatori, G., Turhan, AY. (eds) Rules and Reasoning. RuleML+RR 2022. Lecture Notes in Computer Science, vol 13752. Springer, Cham. https://doi.org/10.1007/978-3-031-21541-4_8
Download citation
DOI: https://doi.org/10.1007/978-3-031-21541-4_8
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-21540-7
Online ISBN: 978-3-031-21541-4
eBook Packages: Computer ScienceComputer Science (R0)