Explaining Explanations in Probabilistic Logic Programming Using Choice Expressions and Proof Trees

This paper introduces a novel approach to enhancing explainability in Probabilistic Logic Programming (PLP) by combining proof trees with a new, compact representation for sets of choices called "choice expressions."