Abstract
Explanation services are a crucial aspect of symbolic reasoning systems but they have not been explored in detail for defeasible formalisms such as KLM. We evaluate prior work on the topic with a focus on KLM propositional logic and find that a form of defeasible explanation initially described for Rational Closure which we term weak justification can be adapted to Relevant and Lexicographic Closure as well as described in terms of intuitive properties derived from the KLM postulates. We also consider how a more general definition of defeasible explanation known as strong explanation applies to KLM and propose an algorithm that enumerates these justifications for Rational Closure.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bail. S.P.: The justificatory structure of OWL ontologies. PhD thesis, University of Manchester (2013)
Biran, O., Cotton, C.: Explanation and justification in machine learning: a survey. In: IJCAI-17 Workshop on Explainable AI (XAI), vol. 8, pp. 8–13 (2017)
Brewka, G., Ulbricht, M.: Strong explanations for nonmonotonic reasoning. In: Description Logic, Theory Combination, and All That, pages 135–146. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-22102-7
Casini, G., Meyer, T., Moodley, K., Nortjé, R.: Relevant closure: a new form of defeasible reasoning for description logics. In: Fermé, E., Leite, J. (eds.), Logics in Artificial Intelligence, pp. 92–106. Springer, Cham (2021)
Casini, G., Meyer, T., Moodley, K., Varzinczak, I.: Towards practical defeasible reasoning for description logics (2013)
Casini, G., Meyer, T., Varzinczak, I.: Taking defeasible entailment beyond rational closure. In: Calimeri, F., Leone, N., Manna, M. (eds.) JELIA 2019. LNCS (LNAI), vol. 11468, pp. 182–197. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-19570-0_12
Casini, G., Straccia, U.: Defeasible inheritance-based description logics. J. Artif. Intell. Res. 48, 415–473 (2013)
Chama, V.: Explanation for defeasible entailment. Master’s thesis, Faculty of Science (2020)
From propositional logic to description logics: Laura Giordano, Valentina Gliozzi, Nicola Olivetti, and Gian Luca Pozzato. semantic characterization of rational closure. Artif. Intell. 226, 1–33 (2015)
Horridge, M.: Justification based explanation in ontologies. The University of Manchester (United Kingdom) (2011)
Kraus, S., Lehmann, D., Magidor, M.: Nonmonotonic reasoning, preferential models and cumulative logics. Artif. Intell. 44(1), 167–207 (1990)
Lehmann, D.: Another perspective on default reasoning. Ann. Math. Artilf. Intell. 15(1), 61–82 (1995)
Lehmann, D., Magidor, M.: What does a conditional knowledge base entail? Artif. Intell. 55(1), 1–60 (1992)
Moodley, K.: Practical reasoning for defeasable description logics. PhD thesis, University of KwaZulu-Natal (2016)
Morris, M., Ross, T., Meyer, T.: Algorithmic definitions for KLM-style defeasible disjunctive datalog. South Afr. Comput. J. 32(2), 141–160 (2020)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
A Supplementary Material
A Supplementary Material
The full paper with the appendix containing proofs for all propositions and additional details for algorithms is available at: https://www.cair.org.za/sites/default/files/2021-11/Explanation_For_KLM.pdf
Rights and permissions
Copyright information
© 2022 Springer Nature Switzerland AG
About this paper
Cite this paper
Everett, L., Morris, E., Meyer, T. (2022). Explanation for KLM-Style Defeasible Reasoning. In: Jembere, E., Gerber, A.J., Viriri, S., Pillay, A. (eds) Artificial Intelligence Research. SACAIR 2021. Communications in Computer and Information Science, vol 1551. Springer, Cham. https://doi.org/10.1007/978-3-030-95070-5_13
Download citation
DOI: https://doi.org/10.1007/978-3-030-95070-5_13
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-95069-9
Online ISBN: 978-3-030-95070-5
eBook Packages: Computer ScienceComputer Science (R0)