default search action
Miikka Vilander
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j3]Lauri Hella, Miikka Vilander:
Defining long words succinctly in FO and MSO. Comput. 13(3-4): 377-398 (2024) - [c7]Reijo Jaakkola, Tomi Janhunen, Antti Kuusisto, Masood Feyzbakhsh Rankooh, Miikka Vilander:
Interpretable Classifiers for Tabular Data via Feature Selection and Discretization. DAO-XAI@ECAI 2024 - [i11]Reijo Jaakkola, Tomi Janhunen, Antti Kuusisto, Masood Feyzbakhsh Rankooh, Miikka Vilander:
Interpretable classifiers for tabular data via discretization and feature selection. CoRR abs/2402.05680 (2024) - [i10]Reijo Jaakkola, Tomi Janhunen, Antti Kuusisto, Masood Feyzbakhsh Rankooh, Miikka Vilander:
Globally Interpretable Classifiers via Boolean Formulas with Dynamic Propositions. CoRR abs/2406.01114 (2024) - [i9]Reijo Jaakkola, Antti Kuusisto, Miikka Vilander:
Description Complexity of Unary Structures in First-Order Logic with Links to Entropy. CoRR abs/2406.02108 (2024) - 2023
- [c6]Reijo Jaakkola
, Tomi Janhunen
Short Boolean Formulas as Explanations in Practice. JELIA 2023: 90-105 - [c5]Reijo Jaakkola, Antti Kuusisto, Miikka Vilander
Relating Description Complexity to Entropy. STACS 2023: 38:1-38:18 - [i8]Reijo Jaakkola, Antti Kuusisto, Miikka Vilander:
A monotone connection between model class size and description length. CoRR abs/2301.13800 (2023) - [i7]Reijo Jaakkola, Tomi Janhunen, Antti Kuusisto, Masood Feyzbakhsh Rankooh, Miikka Vilander:
Short Boolean Formulas as Explanations in Practice. CoRR abs/2307.06971 (2023) - 2022
- [c4]Lauri Hella
Defining Long Words Succinctly in FO and MSO. CiE 2022: 125-138 - [c3]Reijo Jaakkola, Tomi Janhunen, Antti Kuusisto, Masood Feyzbakhsh Rankooh, Miikka Vilander:
Explainability via Short Formulas: the Case of Propositional Logic with Implementation. HYDRA/RCRA@LPNMR 2022: 64-77 - [i6]Lauri Hella, Miikka Vilander:
Defining long words succinctly in FO and MSO. CoRR abs/2202.10180 (2022) - [i5]Reijo Jaakkola, Tomi Janhunen, Antti Kuusisto, Masood Feyzbakhsh Rankooh, Miikka Vilander:
Explainability via Short Formulas: the Case of Propositional Logic with Implementation. CoRR abs/2209.01403 (2022) - [i4]Reijo Jaakkola, Antti Kuusisto, Miikka Vilander:
Relating description complexity to entropy. CoRR abs/2209.12564 (2022) - 2021
- [c2]Miikka Vilander
Games for Succinctness of Regular Expressions. GandALF 2021: 258-272
2010 – 2019
- 2019
- [j2]Martin Lück, Miikka Vilander:
On the Succinctness of Atoms of Dependency. Log. Methods Comput. Sci. 15(3) (2019) - [j1]Lauri Hella
Formula size games for modal logic and μ-calculus. J. Log. Comput. 29(8): 1311-1344 (2019) - [i3]Martin Lück, Miikka Vilander:
On the Succinctness of Atoms of Dependency. CoRR abs/1903.02344 (2019) - [i2]Lauri Hella, Miikka Vilander:
Formula size games for modal logic and μ-calculus. CoRR abs/1912.08715 (2019) - 2016
- [c1]Lauri Hella, Miikka Vilander:
The succinctness of first-order logic over modal logic via a formula size game. Advances in Modal Logic 2016: 401-419 - [i1]Lauri Hella, Miikka Vilander:
The Succinctness of First-order Logic over Modal Logic via a Formula Size Game. CoRR abs/1604.07225 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-16 22:26 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: