11 citations · 19 across the 12 of their papers we have counts for
3 papers · 1 filter
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-…
Relating description complexity to entropy
Reijo Jaakkola, Antti Kuusisto, Miikka Vilander
We demonstrate some novel links between entropy and description complexity, a notion referring to the minimal formula length for specifying given properties. Let MLU be the logic o…
Defining long words succinctly in FO and MSO
Lauri Hella, Miikka Vilander
We consider the length of the longest word definable in FO and MSO via a formula of size n. For both logics we obtain as an upper bound for this number an exponential tower of heig…