Miikka Vilander

Orcid: 0000-0002-7301-939X

According to our database1, Miikka Vilander authored at least 10 papers between 2016 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Interpretable classifiers for tabular data via discretization and feature selection.
CoRR, 2024

2023
A monotone connection between model class size and description length.
CoRR, 2023

Relating Description Complexity to Entropy.
Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science, 2023

Short Boolean Formulas as Explanations in Practice.
Proceedings of the Logics in Artificial Intelligence - 18th European Conference, 2023

2022
Explainability via Short Formulas: the Case of Propositional Logic with Implementation.
Proceedings of the Joint Proceedings of the 1st International Workshop on HYbrid Models for Coupling Deductive and Inductive ReAsoning (HYDRA 2022) and the 29th RCRA Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion (RCRA 2022) co-located with the 16th International Conference on Logic Programming and Non-monotonic Reasoning (LPNMR 2022), 2022

Defining Long Words Succinctly in FO and MSO.
Proceedings of the Revolutions and Revelations in Computability, 2022

2021
Games for Succinctness of Regular Expressions.
Proceedings of the Proceedings 12th International Symposium on Games, 2021

2019
Formula size games for modal logic and μ-calculus.
J. Log. Comput., 2019

On the Succinctness of Atoms of Dependency.
Log. Methods Comput. Sci., 2019

2016
The succinctness of first-order logic over modal logic via a formula size game.
Proceedings of the Advances in Modal Logic 11, 2016


  Loading...