Abstract
In the current paper we propose a general framework for answering queries over inconsistent DL knowledge bases. The proposed framework considers the ICAR semantics and is based on a rewriting algorithm that can be applied over arbitrary DLs. Since the problem of ICAR-answering is known to be intractable for DLs other than DL-Lite, our algorithm may not terminate. However, we were able to describe sufficient termination conditions and to show that they are always satisfied for instance queries and TBoxes expressed in the semi-acyclic-\(\mathcal {EL}_{\bot }\) as well as in DL-Lite\(_{bool}\). Interestingly, recent results on UCQ-rewritability and existing techniques can be used within the proposed framework, to check if the conditions are satisfied for a given query and ontology expressed in a DL for which the problem is in general intractable.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Artale, A., Calvanese, D., Kontchakov, R., Zakharyaschev, M.: The DL-Lite family and relations. J. Artif. Intell. Res. 36, 1–69 (2009)
Baader, F., McGuinness, D.L., Nardi, D., Patel-Schneider, P.F.: The Description Logic Handbook: Theory, Implementation and Applications. Cambridge University Press, Cambridge (2002)
Bienvenu, M.: Inconsistency-tolerant ontology-based data access revisited: taking mappings into account. In: Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI 2018, 13–19 July 2018, Stockholm, Sweden, pp. 1721–1729 (2018)
Bienvenu, M., Bourgaux, C.: Inconsistency-tolerant querying of description logic knowledge bases. In: Reasoning Web: Logical Foundation of Knowledge Graph Construction and Query Answering - 12th International Summer School 2016, Aberdeen, UK, 5–9 September 2016, Tutorial Lectures, pp. 156–202 (2016)
Bienvenu, M., Bourgaux, C., Goasdoué, F.: Querying inconsistent description logic knowledge bases under preferred repair semantics. In: AAAI, pp. 996–1002 (2014)
Bienvenu, M., Hansen, P., Lutz, C., Wolter, F.: First order-rewritability and containment of conjunctive queries in horn description logics. In IJCAI: International Joint Conference on Artificial Intelligence (2016)
Bienvenu, M., Lutz, C., Wolter, F.: Deciding FO-rewritability in \(\cal{EL}\). In: Proceedings of the Twenty-Fifth International Workshop on Description Logics (2012)
Bienvenu, M., Lutz, C., Wolter, F.: First-order rewritability of atomic queries in Horn description logics. In: Proceeding of the Twenty-Third International Joint Conference on Artificial Intelligence (2013)
Bienvenu, M., Rosati, R.: Tractable approximations of consistent query answering for robust ontology-based data access. In: IJCAI 2013, Proceedings of the 23rd International Joint Conference on Artificial Intelligence, Beijing, China, 3–9 August 2013, pp. 775–781 (2013)
Bienvenu, M., Cate, B.T., Lutz, C., Wolter, F.: Ontology-based data access: a study through disjunctive datalog, CSP, and MMSNP. ACM Trans. Database Syst. 39(4), 33:1–33:44 (2014)
Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: Tractable reasoning and efficient query answering in description logics: the DL-Lite family. J. Autom. Reasoning 39(3), 385–429 (2007)
Grau, B.C., Motik, B., Stoilos, G., Horrocks, I.: Computing datalog rewritings beyond Horn ontologies. In: Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence (2013)
De Giacomo, G., Lembo, D., Oriol, X., Savo, D.F., Teniente, E.: Practical update management in ontology-based data access. In: d’Amato, C., et al. (eds.) ISWC 2017. LNCS, vol. 10587, pp. 225–242. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-68288-4_14
Hansen, P., Lutz, C.: Computing FO-rewritings in EL in practice: from atomic to conjunctive queries. In: The Semantic Web - ISWC 2017–16th International Semantic Web Conference, Vienna, Austria, 21–25 October 2017, Proceedings, Part I, pp. 347–363 (2017)
Hansen, P., Lutz, C., Seylan, I., Wolter, F.: Efficient query rewriting in the description logic \(\cal{EL}\) and beyond. In: Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, pp. 3034–3040 (2015)
Kikot, S., Kontchakov, R., Zakharyaschev, M.: Conjunctive query answering with OWL 2 QL. In: Proceedings of the Thirteenth International Conference on Principles of Knowledge Representation and Reasoning (2012)
Kiryakov, A., Bishoa, B., Ognyanoff, D., Peikov, I., Tashev, Z., Velkov, R.: The features of BigOWLIM that enabled the BBCs world cup website. In: Workshop on Semantic Data Management (SemData), pp. 13–17 (2010)
Lembo, D., Lenzerini, M., Rosati, R., Ruzzi, M., Savo, D.F.: Inconsistency-tolerant semantics for description logics. In: Hitzler, P., Lukasiewicz, T. (eds.) RR 2010. LNCS, vol. 6333, pp. 103–117. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-15918-3_9
Lembo, D., Lenzerini, M., Rosati, R., Ruzzi, M., Savo, D.F.: Query rewriting for inconsistent DL-Lite ontologies. In: Rudolph, S., Gutierrez, C. (eds.) RR 2011. LNCS, vol. 6902, pp. 155–169. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-23580-1_12
Lembo, D., Lenzerini, M., Rosati, R., Ruzzi, M., Savo, D.F.: Inconsistency-tolerant query answering in ontology-based data access. J. Web Semant. 33, 3–29 (2015)
Pérez-Urbina, H., Motik, B., Horrocks, I.: Tractable query answering and rewriting under description logic constraints. J. Appl. Logic 8(2), 186–209 (2010)
Rosati, R.: On the complexity of dealing with inconsistency in description logic ontologies. In: Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence, pp. 1057–1062 (2011)
Stoilos, G., Grau, B.C., Motik, B., Horrocks, I.: Repairing ontologies for incomplete reasoners. In: Proceedings of the 10th International Semantic Web Conference, Bonn, Germany, pp. 681–696 (2011)
Trivela, D., Stoilos, G., Chortaras, A., Stamou, G.: Optimising resolution-based rewriting algorithms for OWL ontologies. J. Web Semant. 33, 30–49 (2015)
Trivela, D., Stoilos, G., Vassalos, V.: A framework and positive results for IAR-answering. In: Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, New Orleans, Louisiana, USA, 2–7 February 2018 (2018)
Tsalapati, E., Stoilos, G., Stamou, G.B., Koletsos, G.: Efficient query answering over expressive inconsistent description logics. In: Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, pp. 1279–1285 (2016)
Acknowledgements
Research supported by EU’s Horizon 2020 research and innovation programme, grant agreement No. 720270 (HBP SGA1) and by the Research Centre of the Athens University of Economics and Business, in the framework of “Research Funding at AUEB for Excellence and Extroversion” (Action 2, 2017–2018). Part of this work was conducted when Giorgos Stoilos was working at AUEB.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Trivela, D., Stoilos, G., Vassalos, V. (2019). Query Rewriting for DL Ontologies Under the ICAR Semantics. In: Fodor, P., Montali, M., Calvanese, D., Roman, D. (eds) Rules and Reasoning. RuleML+RR 2019. Lecture Notes in Computer Science(), vol 11784. Springer, Cham. https://doi.org/10.1007/978-3-030-31095-0_10
Download citation
DOI: https://doi.org/10.1007/978-3-030-31095-0_10
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-31094-3
Online ISBN: 978-3-030-31095-0
eBook Packages: Computer ScienceComputer Science (R0)