Vidal, G. (2024). Explaining Explanations in Probabilistic Logic Programming. In Programming Languages and Systems (Proceedings of APLAS 2024) (Springer LNCS). https://doi.org/10.1007/978-981-97-8943-6_7
This paper addresses the challenge of generating comprehensible explanations for query results in Probabilistic Logic Programming (PLP), aiming to improve the interpretability of traditional explanation methods like Most Probable Explanation (MPE).
The authors introduce an algebra of "choice expressions" as a compact and manipulable representation for sets of choices in PLP. They then develop SLPDNF-resolution, a query-driven inference mechanism that extends SLDNF-resolution to handle LPADs (Logic Programs with Annotated Disjunctions) and incorporates choice expressions.
The proposed approach of combining proof trees and choice expressions significantly improves the explainability of PLP models. This method provides users with a more intuitive understanding of the reasoning behind query results, addressing a key limitation of existing black-box approaches in Explainable AI (XAI).
This research contributes to the field of XAI by providing a concrete method for generating transparent and understandable explanations in the context of PLP. This is particularly relevant for decision support systems and applications where users need to understand the rationale behind system outputs.
The paper focuses on ground queries and assumes sound programs. Future work could explore extending the approach to handle non-ground queries and address potential challenges in programs with cycles or inconsistencies. Additionally, investigating the integration of this method with existing probabilistic inference algorithms could further enhance its practical applicability.
In un'altra lingua
dal contenuto originale
arxiv.org
Approfondimenti chiave tratti da
by Germ... alle arxiv.org 10-23-2024
https://arxiv.org/pdf/2401.17045.pdfDomande più approfondite