Abstract
Most query rewriting systems focus on answering Conjunctive Queries that have only positive atoms because the use of negation can easily make the entailment problem undecidable. However, restricting the way we use negation on Conjunctive Queries can make the entailment problem decidable and can also ensure the existence of algorithms based on Query Rewriting that find their answers. In this paper, we propose a definition of Horn Conjunctive Queries to denote queries that have one negated atom. We also present an algorithm based on query rewriting that finds the answers of a Union of Horn Conjunctive Queries with respect to a set of Existential Rules. Additionally, we conduct some experiments to compare the performance with other state of the art systems that are able to answer conjunctive queries with negation using tableaux algorithms. The experimental data confirms that our system performs better than the other systems we considered when dealing with big ontologies.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Baader, F., Calvanese, D., McGuinness, D.L., Nardi, D., Patel-Schneider, P.F. (eds.): The Description Logic Handbook: Theory, Implementation, and Applications. Cambridge University Press, New York (2003)
Baget, J.F., Gutierrez, A., Leclère, M., Mugnier, M.L., Rocher, S., Sipieter, C.: Datalog+, RuleML and OWL 2: formats and translations for existential rules. In: RuleML: Web Rule Symposium, Berlin, Germany, August 2015. https://hal.archives-ouvertes.fr/hal-01172069
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
Baget, J.F., Leclére, M., Mugnier, M.L., Salvat, E.: On rules with existential variables: Walking the decidability line. Artif. Intell. 175(9), 1620–1654 (2011). http://www.sciencedirect.com/science/article/pii/S0004370211000397, https://doi.org/10.1016/j.artint.2011.03.002
Bárány, V., ten Cate, B., Otto, M.: Queries with guarded negation (full version). CoRR abs/1203.0077 (2012). http://arxiv.org/abs/1203.0077
Calvanese, D., Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: Tractable reasoning and efficient query answering in description logics: the DL-Lite family. J. Autom. Reason. 39(3), 385–429 (2007). http://dx.doi.org/10.1007/s10817-007-9078-x
Chandra, A.K., Merlin, P.M.: Optimal implementation of conjunctive queries in relational data bases. In: Proceedings of the Ninth Annual ACM Symposium on Theory of Computing, STOC 1977, pp. 77–90. ACM, New York (1977). http://doi.acm.org/10.1145/800105.803397
Du, J., Pan, J.Z.: Rewriting-based instance retrieval for negated concepts in description logic ontologies. In: Arenas, M., et al. (eds.) ISWC 2015. LNCS, vol. 9366, pp. 339–355. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-25007-6_20
Glimm, B., Horrocks, I., Motik, B., Stoilos, G., Wang, Z.: HermiT: an OWL 2 reasoner. J. Autom. Reason. 53(3), 245–269 (2014). https://doi.org/10.1007/s10817-014-9305-1
Guo, Y., Pan, Z., Heflin, J.: LUBM: a benchmark for OWL knowledge base systems. Web Semant. 3(2–3), 158–182 (2005). http://dx.doi.org/10.1016/j.websem.2005.06.005
Gutiérrez-Basulto, V., Ibañez-GarcÃa, Y., Kontchakov, R., Kostylev, E.V.: Conjunctive queries with negation over DL-lite: a closer look. In: Faber, W., Lembo, D. (eds.) RR 2013. LNCS, vol. 7994, pp. 109–122. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-39666-3_9
Hall, M., Frank, E., Holmes, G., Pfahringer, B., Reutemann, P., Witten, I.H.: The WEKA data mining software: an update. SIGKDD Explor. Newsl. 11(1), 10–18 (2009). http://doi.acm.org/10.1145/1656274.1656278
König, M., Leclère, M., Mugnier, M., Thomazo, M.: Sound, complete and minimal UCQ-rewriting for existential rules. Semant. Web 6(5), 451–475 (2015). https://doi.org/10.3233/SW-140153
Alfonso, E.M., Stamou, G.: Rewriting queries with negated atoms. In: Costantini, S., Franconi, E., Van Woensel, W., Kontchakov, R., Sadri, F., Roman, D. (eds.) RuleML+RR 2017. LNCS, vol. 10364, pp. 151–167. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-61252-2_11
Tsarkov, D., Horrocks, I.: FaCT++ description logic reasoner: system description. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol. 4130, pp. 292–297. Springer, Heidelberg (2006). https://doi.org/10.1007/11814771_26
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this paper
Cite this paper
Matos Alfonso, E., Stamou, G. (2018). On Horn Conjunctive Queries. In: Benzmüller, C., Ricca, F., Parent, X., Roman, D. (eds) Rules and Reasoning. RuleML+RR 2018. Lecture Notes in Computer Science(), vol 11092. Springer, Cham. https://doi.org/10.1007/978-3-319-99906-7_8
Download citation
DOI: https://doi.org/10.1007/978-3-319-99906-7_8
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-99905-0
Online ISBN: 978-3-319-99906-7
eBook Packages: Computer ScienceComputer Science (R0)