Abstract
Research on inconsistency-tolerant query answering usually assumes that the terminological knowledge is correct, and only the facts (ABox) need to be repaired. In this paper we study the problem of answering instance queries over inconsistent ontologies, by repairing the whole knowledge base (KB). Contrary to ABox repairs, when KB repairs are considered, instance checking in \(\textit{DL}\text {-}{} \textit{Lite}_\textit{Horn}\) w.r.t. the brave semantics remains tractable, and the intersection semantics allow for an any-time algorithm. We also show that inconsistency-tolerant instance checking w.r.t. ABox repairs is intractable even if only polynomially many ABox repairs exist.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
A hitting set for e.g. \(\mathsf {Rep}_{\mathcal {K}}\) is a set \(\mathcal {S} \) that satisfies \(\mathcal {S} \cap \mathcal {R} \not =\emptyset \) for every \(\mathcal {R} \in \mathsf {Rep}_{\mathcal {K}} \).
- 2.
Throughout this section, \(\mathsf {Rep}_{\mathcal {K}}\) denotes the set of all ABox repairs.
- 3.
For simplicity, we identify a propositional valuation \(\mathcal {V}\) with the set of variables that it makes true.
- 4.
One can think of this problem as the dual of the one considered in the proof of TheoremĀ 9.
References
Arenas, M., Bertossi, L.E., Chomicki, J.: Consistent query answers in inconsistent databases. In: Vianu, V., Papadimitriou, C.H. (eds.) Proceedings of the Eighteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS 1999), pp. 68ā79. ACM Press (1999). http://doi.acm.org/10.1145/303976.303983
Arif, M.F., MencĆa, C., Ignatiev, A., Manthey, N., PeƱaloza, R., Marques-Silva, J.: BEACON: an efficient SAT-based tool for debugging \({\cal{EL}}{^+}\) ontologies. In: Creignou, N., Le Berre, D. (eds.) SAT 2016. LNCS, vol. 9710, pp. 521ā530. Springer, Cham (2016). doi:10.1007/978-3-319-40970-2_32
Arif, M.F., MencĆa, C., Marques-Silva, J.: Efficient axiom pinpointing with EL2MCS. In: Hƶlldobler, S., Krƶtzsch, M., PeƱaloza, R., Rudolph, S. (eds.) KI 2015. LNCS, vol. 9324, pp. 225ā233. Springer, Cham (2015). doi:10.1007/978-3-319-24489-1_17
Artale, A., Calvanese, D., Kontchakov, R., Zakharyaschev, M.: The DL-Lite family and relations. J. Artif. Intell. Res. 36, 1ā69 (2009)
Baader, F., PeƱaloza, R., Suntisrivaraporn, B.: Pinpointing in the description logic \(\cal{EL}^+\). In: Hertzberg, J., Beetz, M., Englert, R. (eds.) KI 2007. LNAI, vol. 4667, pp. 52ā67. Springer, Heidelberg (2007)
Bienvenu, M.: On the complexity of consistent query answering in the presence of simple ontologies. In: Hoffmann, J., Selman, B. (eds.) Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence (AAAI-12). AAAI Press (2012). http://www.aaai.org/ocs/index.php/AAAI/AAAI12/paper/view/4928
Bienvenu, M., Bourgaux, C., GoasdouĆ©, F.: Querying inconsistent description logic knowledge bases under preferred repair semantics. In: Brodley, C.E., Stone, P. (eds.) Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence (AAAI-14), pp. 996ā1002. AAAI Press (2014). http://www.aaai.org/ocs/index.php/AAAI/AAAI14/paper/view/8231
Bienvenu, M., Rosati, R.: Tractable approximations of consistent query answering for robust ontology-based data access. In: Rossi, F. (ed.) Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI-13), pp. 775ā781. AAAI Press (2013). http://www.aaai.org/ocs/index.php/IJCAI/IJCAI13/paper/view/6904
Downey, R.G., Fellows, M.: Parameterized Complexity. Monographs in Computer Science. Springer, New York (1999)
Eiter, T., Gottlob, G.: Identifying the minimal transversals of a hypergraph and related problems. Technical report. CD-TR 91/16, Christian Doppler Laboratory for Expert Systems, TU Vienna (1991)
Eiter, T., Gottlob, G.: Identifying the minimal transversals of a hypergraph and related problems. SIAM J. Comput. 24(6), 1278ā1304 (1995)
Eiter, T., Lukasiewicz, T., Predoiu, L.: Generalized consistent query answering under existential rules. In: Baral, C., Delgrande, J.P., Wolter, F. (eds.) Proceedings of the 15th International Conference on Principles of Knowledge Representation and Reasoning (KR 2016), pp. 359ā368. AAAI Press (2016)
Fredman, M.L., Khachiyan, L.: On the complexity of dualization of monotone disjunctive normal forms. J. Algorithms 21(3), 618ā628 (1996)
Gottlob, G., Malizia, E.: Achieving new upper bounds for the hypergraph duality problem through logic. The Computing Research Repository (CoRR) abs/1407.2912 (2014). http://arxiv.org/abs/1407.2912
Hagen, M.: Algorithmic and Computational Complexity Issues of MONET. Ph.D. dissertation, Institut fĆ¼r Informatik, Friedrich-Schiller-UniversitƤt Jena (2008)
Horridge, M., Parsia, B., Sattler, U.: Explaining inconsistencies in OWL ontologies. In: Godo, L., Pugliese, A. (eds.) SUM 2009. LNCS, vol. 5785, pp. 124ā137. Springer, Heidelberg (2009). doi:10.1007/978-3-642-04388-8_11
Johnson, D.S., Yannakakis, M., Papadimitriou, C.H.: On generating all maximal independent sets. Inform. Process. Lett. 27(3), 119ā123 (1988)
Kalyanpur, A., Parsia, B., Sirin, E., Cuenca-Grau, B.: Repairing unsatisfiable concepts in OWL ontologies. In: Sure, Y., Domingue, J. (eds.) ESWC 2006. LNCS, vol. 4011, pp. 170ā184. Springer, Heidelberg (2006). doi:10.1007/11762256_15
Kavvadias, D.J., Sideri, M., Stavropoulos, E.C.: Generating all maximal models of a boolean expression. Inform. Process. Lett. 74(3ā4), 157ā162 (2000). http://dx.doi.org/10.1016/S0020-0190(00)00023-5
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). doi:10.1007/978-3-642-15918-3_9
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). http://dx.doi.org/10.1016/j.websem.2015.04.002
Ludwig, M., PeƱaloza, R.: Error-tolerant reasoning in the description logic \(\cal{E{}L}\). In: FermĆ©, E., Leite, J. (eds.) JELIA 2014. LNCS, vol. 8761, pp. 107ā121. Springer, Cham (2014). doi:10.1007/978-3-319-11558-0_8
Lukasiewicz, T., Martinez, M.V., Pieris, A., Simari, G.I.: From classical to consistent query answering under existential rules. In: Bonet, B., Koenig, S. (eds.) Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence (AAAI-15), pp. 1546ā1552. AAAI Press (2015). http://www.aaai.org/ocs/index.php/AAAI/AAAI15/paper/view/9817
Lukasiewicz, T., Martinez, M.V., Simari, G.I.: Inconsistency handling in datalog+/- ontologies. In: Raedt, L.D., BessiĆØre, C., Dubois, D., Doherty, P., Frasconi, P., Heintz, F., Lucas, P.J.F. (eds.) Proceedings of the 20th European Conference on Artificial Intelligence (ECAI-2012). Frontiers in Artificial Intelligence and Applications, vol. 242, pp. 558ā563. IOS Press (2012). http://dx.doi.org/10.3233/978-1-61499-098-7-558
Marino, A.: Analysis and Enumeration: Algorithms for Biological Graphs. Springer, New York (2015)
Marques-Silva, J., Ignatiev, A., MencĆa, C., PeƱaloza, R.: Efficient reasoning for inconsistent horn formulae. In: Michael, L., Kakas, A. (eds.) JELIA 2016. LNCS, vol. 10021, pp. 336ā352. Springer, Cham (2016). doi:10.1007/978-3-319-48758-8_22
Nielsen, L.R., Andersen, K.A., Pretolani, D.: Finding the K shortest hyperpaths. Comput. Oper. Res. 32(6), 1477ā1497 (2005)
Parsia, B., Sirin, E., Kalyanpur, A.: Debugging OWL ontologies. In: Ellis, A., Hagino, T. (eds.) Proceedings of the 14th International Conference on World Wide Web (WWW 2005), pp. 633ā640. ACM (2005)
PeƱaloza, R., Sertkaya, B.: Complexity of axiom pinpointing in the dl-lite family of description logics. In: Coelho, H., Studer, R., Wooldridge, M. (eds.) Proceedings of the 19th European Conference on Artificial Intelligence (ECAI-2010). Frontiers in Artificial Intelligence and Applications, vol. 215, pp. 29ā34. IOS Press (2010)
PeƱaloza, R., Sertkaya, B.: Understanding the complexity of axiom pinpointing in lightweight description logics. Artificial Intelligence (2017, to appear)
PeƱaloza, R.: Axiom pinpointing in description logics and beyond. Ph.D. thesis, Technische UniversitƤt Dresden (2009). http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-24743
Rosati, R.: On the complexity of dealing with inconsistency in description logic ontologies, pp. 1057ā1062. AAAI Press (2011). http://dx.doi.org/10.5591/978-1-57735-516-8/IJCAI11-181
Schlobach, S., Cornet, R.: Non-standard reasoning services for the debugging of description logic terminologies. In: Gottlob, G., Walsh, T. (eds.) Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI-03), pp. 355ā362. Morgan Kaufmann (2003)
Schlobach, S., Huang, Z., Cornet, R., Harmelen, F.: Debugging incoherent terminologies. J. Autom. Reasoning 39(3), 317ā349 (2007)
Tsalapati, E., Stoilos, G., Stamou, G.B., Koletsos, G.: Efficient query answering over expressive inconsistent description logics, pp. 1279ā1285. AAAI Press (2016). http://www.ijcai.org/Abstract/16/185
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
Ā© 2017 Springer International Publishing AG
About this paper
Cite this paper
PeƱaloza, R. (2017). Inconsistency-Tolerant Instance Checking in Tractable Description Logics. In: Costantini, S., Franconi, E., Van Woensel, W., Kontchakov, R., Sadri, F., Roman, D. (eds) Rules and Reasoning. RuleML+RR 2017. Lecture Notes in Computer Science(), vol 10364. Springer, Cham. https://doi.org/10.1007/978-3-319-61252-2_15
Download citation
DOI: https://doi.org/10.1007/978-3-319-61252-2_15
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-61251-5
Online ISBN: 978-3-319-61252-2
eBook Packages: Computer ScienceComputer Science (R0)