2 citations · 3 across the 16 of their papers we have counts for
6 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-…
Complexity of Polyadic Boolean Modal Logics: Model Checking and Satisfiability
Reijo Jaakkola
We study the computational complexity of model checking and satisfiability problems of polyadic modal logics extended with permutations and Boolean operators on accessibility relat…
Convergence in the space of compact labeled metric spaces
Reijo Jaakkola, Antti Kykkänen
A labeled metric space is intuitively speaking a metric space together with a special set of points to be understood as the geometric boundary of the space. We study basic properti…
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…
First-order logic with self-reference
Reijo Jaakkola, Antti Kuusisto
We consider an extension of first-order logic with a recursion operator that corresponds to allowing formulas to refer to themselves. We investigate the obtained language under two…
Towards a Model Theory of Ordered Logics: Expressivity and Interpolation (Extended version)
Bartosz Bednarczyk, Reijo Jaakkola
We consider the family of guarded and unguarded ordered logics, that constitute a recently rediscovered family of decidable fragments of first-order logic (FO), in which the order…