Ordered fragments of first-order logic R Jaakkola arXiv preprint arXiv:2103.08046, 2021 | 10 | 2021 |
Explainability via short formulas: the case of propositional logic with implementation R Jaakkola, T Janhunen, A Kuusisto, MF Rankooh, M Vilander arXiv preprint arXiv:2209.01403, 2022 | 6 | 2022 |
Algebraic classifications for fragments of first-order logic and beyond R Jaakkola, A Kuusisto arXiv preprint arXiv:2005.01184, 2020 | 6 | 2020 |
Short boolean formulas as explanations in practice R Jaakkola, T Janhunen, A Kuusisto, MF Rankooh, M Vilander European Conference on Logics in Artificial Intelligence, 90-105, 2023 | 4 | 2023 |
Towards a model theory of ordered logics: Expressivity and interpolation B Bednarczyk, R Jaakkola International Symposium on Mathematical Foundations of Computer Science …, 2022 | 4 | 2022 |
Complexity classifications via algebraic logic R Jaakkola, A Kuusisto Annual Conference on Computer Science Logic, 27, 2023 | 2 | 2023 |
Relating description complexity to entropy R Jaakkola, A Kuusisto, M Vilander arXiv preprint arXiv:2209.12564, 2022 | 2 | 2022 |
Uniform Guarded Fragments R Jaakkola International Conference on Foundations of Software Science and Computation …, 2022 | 2 | 2022 |
Interpretable classifiers for tabular data via discretization and feature selection R Jaakkola, T Janhunen, A Kuusisto, MF Rankooh, M Vilander arXiv preprint arXiv:2402.05680, 2024 | 1 | 2024 |
First-order logic with self-reference R Jaakkola, A Kuusisto arXiv preprint arXiv:2207.07397, 2022 | 1 | 2022 |
Description Complexity of Unary Structures in First-Order Logic with Links to Entropy R Jaakkola, A Kuusisto, M Vilander arXiv preprint arXiv:2406.02108, 2024 | | 2024 |
Globally Interpretable Classifiers via Boolean Formulas with Dynamic Propositions R Jaakkola, T Janhunen, A Kuusisto, MF Rankooh, M Vilander arXiv preprint arXiv:2406.01114, 2024 | | 2024 |
Formulas of propositional logic as interpretable classifiers R Jaakkola | | 2024 |
Why do overparameterized neural networks generalize? R Jaakkola | | 2024 |
Complexity of Polyadic Boolean Modal Logics: Model Checking and Satisfiability R Jaakkola Annual Conference on Computer Science Logic, 26, 2023 | | 2023 |
A monotone connection between model class size and description length R Jaakkola, A Kuusisto, M Vilander arXiv preprint arXiv:2301.13800, 2023 | | 2023 |
Convergence in the space of compact labeled metric spaces R Jaakkola, A Kykkänen arXiv preprint arXiv:2210.00535, 2022 | | 2022 |
Towards a Model Theory of Ordered Logics: Expressivity and Interpolation (Extended version) B Bednarczyk, R Jaakkola arXiv preprint arXiv:2206.11751, 2022 | | 2022 |
An Extension of Trakhtenbrot's Theorem R Jaakkola arXiv preprint arXiv:2112.14996, 2021 | | 2021 |
Complexity of the Ackermann fragment with one leading existential quantifier R Jaakkola arXiv preprint arXiv:2111.05388, 2021 | | 2021 |