6 papers
Globally Interpretable Classifiers via Boolean Formulas with Dynamic Propositions
Reijo Jaakkola, Tomi Janhunen, Antti Kuusisto +2
Interpretability and explainability are among the most important challenges of modern artificial intelligence, being mentioned even in various legislative sources. In this article,…
Interpretable classifiers for tabular data via discretization and feature selection
Reijo Jaakkola, Tomi Janhunen, Antti Kuusisto +2
We introduce a method for computing immediately human interpretable yet accurate classifiers from tabular data. The classifiers obtained are short Boolean formulas, computed via fi…
Short Boolean Formulas as Explanations in Practice
Reijo Jaakkola, Tomi Janhunen, Antti Kuusisto +2
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 minim…
Capturing (Optimal) Relaxed Plans with Stable and Supported Models of Logic Programs
Masood Feyzbakhsh Rankooh, Tomi Janhunen
We establish a novel relation between delete-free planning, an important task for the AI Planning community also known as relaxed planning, and logic programming. We show that give…
Explainability via Short Formulas: the Case of Propositional Logic with Implementation
Reijo Jaakkola, Tomi Janhunen, Antti Kuusisto +2
We conceptualize explainability in terms of logic and formula size, giving a number of related definitions of explainability in a very general setting. Our main interest is the so-…
Propositional Encodings of Acyclicity and Reachability by using Vertex Elimination
Masood Feyzbakhsh Rankooh, Jussi Rintanen
We introduce novel methods for encoding acyclicity and s-t-reachability constraints for propositional formulas with underlying directed graphs. They are based on vertex elimination…