English

Short Boolean Formulas as Explanations in Practice

Logic in Computer Science 2023-12-22 v2 Artificial Intelligence Machine Learning

Abstract

We investigate explainability via short Boolean formulas in the data model based on unary relations. As an explanation of length k, we take a Boolean formula of length k that minimizes the error with respect to the target attribute to be explained. We first provide novel quantitative bounds for the expected error in this scenario. We then also demonstrate how the setting works in practice by studying three concrete data sets. In each case, we calculate explanation formulas of different lengths using an encoding in Answer Set Programming. The most accurate formulas we obtain achieve errors similar to other methods on the same data sets. However, due to overfitting, these formulas are not necessarily ideal explanations, so we use cross validation to identify a suitable length for explanations. By limiting to shorter formulas, we obtain explanations that avoid overfitting but are still reasonably accurate and also, importantly, human interpretable.

Keywords

Cite

@article{arxiv.2307.06971,
  title  = {Short Boolean Formulas as Explanations in Practice},
  author = {Reijo Jaakkola and Tomi Janhunen and Antti Kuusisto and Masood Feyzbakhsh Rankooh and Miikka Vilander},
  journal= {arXiv preprint arXiv:2307.06971},
  year   = {2023}
}

Comments

Long version of a paper published in JELIA 2023. Changes to version 1: typos fixed, clarifications added

R2 v1 2026-06-28T11:29:46.415Z