Abstract
We focus on the problem of handling inconsistency in light-weight ontologies. We assume terminological knowledge bases (TBoxes) are specified in DL-Lite and that assertional facts (ABoxes) are partially preordered and may be inconsistent with respect to TBoxes. One of the main contributions of this paper is the provision of an efficient and safe method, called Elect, to restore consistency of the ABox with respect to the TBox. In the case where the assertional bases are flat (no priorities are associated with the ABoxes) or totally preordered, our method collapses with the well-known IAR semantics and non-defeated semantics, respectively. The semantic justification of Elect is obtained by first viewing a partially preordered ABox as a family of totally preordered ABoxes, and then applying non-defeated inference to each of the totally preordered ABoxes. We introduce the concept of elected assertions which allows us to provide an equivalent characterization of Elect without explicitly generating all totally preordered ABoxes. Finally we show that the computation of Elect is done in polynomial time.
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
Baader, F., Calvanese, D., Mcguinness, D., Nardi, D., Patel-Schneider, P.: The Description Logic Handbook: Theory, Implementation, and Applications (2007)
Baget, J., et al.: A general modifier-based framework for inconsistency-tolerant query answering. In: KR, Cape Town, South Africa, pp. 513–516 (2016)
Benferhat, S., Bouraoui, Z., Tabia, K.: How to select one preferred assertional-based repair from inconsistent and prioritized DL-Lite knowledge bases? In: IJCAI, Buenos Aires, Argentina, pp. 1450–1456 (2015)
Benferhat, S., Dubois, D., Prade, H.: Representing default rules in possibilistic logic. In: Knowledge Representation and Reasoning, pp. 673–684 (1992)
Benferhat, S., Dubois, D., Prade, H.: Some syntactic approaches to the handling of inconsistent knowledge bases: a comparative study: Part 2: the prioritized case. Studia Logica 24, 473–511 (1998). Physica-Verlag, Heidelberg
Benferhat, S., Bouraoui, Z., Chadhry, H., Fc, M.S.B.M.R., Tabia, K., Telli, A.: Characterizing non-defeated repairs in inconsistent lightweight ontologies. In: SITIS, pp. 282–287 (2016)
Benferhat, S., Lagrue, S., Papini, O.: Reasoning with partially ordered information in a possibilistic logic framework. Fuzzy Sets Syst. 144(1), 25–41 (2004)
Bienvenu, M., Bourgaux, C., Goasdoué, F.: Querying inconsistent description logic knowledge bases under preferred repair semantics. In: AAAI, pp. 996–1002 (2014)
Bienvenu, M., Rosati, R.: Tractable approximations of consistent query answering for robust ontology-based data access. In: IJCAI, pp. 775–781 (2013)
Bienvenu, M., Bourgaux, C.: Inconsistency-tolerant querying of description logic knowledge bases. In: Pan, J.Z., et al. (eds.) Reasoning Web 2016. LNCS, vol. 9885, pp. 156–202. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-49493-7_5
Brewka, G.: Preferred subtheories: an extended logical framework for default reasoning. In: IJCAI, pp. 1043–1048 (1989)
Calvanese, D., Kharlamov, E., Nutt, W., Zheleznyakov, D.: Evolution of DL-lite knowledge bases. In: International Semantic Web Conference, vol. 1. pp. 112–128 (2010)
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. Reason. 39(3), 385–429 (2007)
Cozman, F.G.: Credal networks. Artif. Intell. J. 120, 199–233 (2000)
Du, J., Qi, G., Shen, Y.: Weight-based consistent query answering over inconsistent SHIQ knowledge bases. Knowl. Inf. Syst. 34(2), 335–371 (2013)
Dubois, D., Fargier, H., Prade, H.: Ordinal and probabilistic representations of acceptance. J. AI Res. 22, 23–56 (2004)
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
Martinez, M.V., Parisi, F., Pugliese, A., Simari, G.I., Subrahmanian, V.S.: Inconsistency management policies. In: KRR, pp. 367–377. AAAI Press (2008)
Rescher, N., Manor, R.: On inference from inconsistent premisses. Theory Decis. 1(2), 179–217 (1970)
Staworko, S., Chomicki, J., Marcinkowski, J.: Prioritized repairing and consistent query answering in relational databases. AMAI 64(2–3), 209–246 (2012)
Telli, A., Benferhat, S., Bourahla, M., Bouraoui, Z., Tabia, K.: Polynomial algorithms for computing a single preferred assertional-based repair. KI 31(1), 15–30 (2017)
Touazi, F., Cayrol, C., Dubois, D.: Possibilistic reasoning with partially ordered beliefs. J. Appl. Log. 13(4), 770–798 (2015)
Trivela, D., Stoilos, G., Vassalos, V.: Querying expressive DL ontologies under the ICAR semantics. In: Proceedings of the 31st DL Workshop, Tempe, USA (2018)
Acknowledgements
This work was supported by the European project H2020-MSCA-RISE: AniAge (High Dimensional Heterogeneous Data based Animation Techniques for Southeast Asian Intangible Cultural Heritage).
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Belabbes, S., Benferhat, S., Chomicki, J. (2019). Elect: An Inconsistency Handling Approach for Partially Preordered Lightweight Ontologies. In: Balduccini, M., Lierler, Y., Woltran, S. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 2019. Lecture Notes in Computer Science(), vol 11481. Springer, Cham. https://doi.org/10.1007/978-3-030-20528-7_16
Download citation
DOI: https://doi.org/10.1007/978-3-030-20528-7_16
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-20527-0
Online ISBN: 978-3-030-20528-7
eBook Packages: Computer ScienceComputer Science (R0)