Reijo Jaakkola

Orcid: 0000-0003-4714-4637

According to our database1, Reijo Jaakkola authored at least 15 papers between 2020 and 2024.

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

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

Complexity Classifications via Algebraic Logic.
Proceedings of the 31st EACSL Annual Conference on Computer Science Logic, 2023

Complexity of Polyadic Boolean Modal Logics: Model Checking and Satisfiability.
Proceedings of the 31st EACSL Annual Conference on Computer Science Logic, 2023

2022
First-order logic with self-reference.
CoRR, 2022

Towards a Model Theory of Ordered Logics: Expressivity and Interpolation (Extended version).
CoRR, 2022

Towards a Model Theory of Ordered Logics: Expressivity and Interpolation.
Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 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

Uniform Guarded Fragments.
Proceedings of the Foundations of Software Science and Computation Structures, 2022

2021
Expressive power versus decidability.
CoRR, 2021

Complexity of the Ackermann fragment with one leading existential quantifier.
CoRR, 2021

Ordered Fragments of First-Order Logic.
Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

2020
Algebraic classifications for fragments of first-order logic and beyond.
CoRR, 2020


  Loading...