research
∙
07/13/2023
Short Boolean Formulas as Explanations in Practice
We investigate explainability via short Boolean formulas in the data mod...
share
research
∙
01/31/2023
A monotone connection between model class size and description length
This paper links sizes of model classes to the minimum lengths of their ...
research
∙
10/03/2022
Complexity of Polyadic Boolean Modal Logics: Model Checking and Satisfiability
We study the computational complexity of model checking and satisfiabili...
research
∙
09/26/2022
Relating description complexity to entropy
We demonstrate some novel links between entropy and description complexi...
research
∙
09/03/2022
Explainability via Short Formulas: the Case of Propositional Logic with Implementation
We conceptualize explainability in terms of logic and formula size, givi...
research
∙
07/15/2022
First-order logic with self-reference
We consider an extension of first-order logic with a recursion operator ...
research
∙
06/23/2022
Towards a Model Theory of Ordered Logics: Expressivity and Interpolation (Extended version)
We consider the family of guarded and unguarded ordered logics, that con...
research
∙
12/30/2021
Expressive power versus decidability
In this note we prove that there exists no fragment of first-order logic...
research
∙
11/09/2021
Complexity of the Ackermann fragment with one leading existential quantifier
In this short note we prove that the satisfiability problem of the Acker...
research
∙
10/07/2021
Uniform Guarded Fragments
In this paper we prove that the uniform one-dimensional guarded fragment...
research
∙
03/14/2021
Ordered fragments of first-order logic
Using a recently introduced algebraic framework for the classification o...
research
∙
05/03/2020
