In short:
Currently, a Professor of the University of Wrocław.
Three years as a postdoc at Imperial College London.
PhD in Computer Science since 2012, habilitation since 2022.

Contact: ja.kub.michaliszyngmail.com.

I. Verification

1. Decidability of Model Checking Multi-Agent Systems with Regular Expressions against Epistemic HS Specifications, Jakub Michaliszyn and Piotr Witkowski, IJCAI 2019
2. Model Checking Multi-Agent Systems against Epistemic HS Specifications with Regular Expressions, Alessio Lomuscio and Jakub Michaliszyn, KR 2016.
3. Verification of Multi-Agent Systems via Predicate Abstraction against ATLK specifications, Alessio Lomuscio and Jakub Michaliszyn, AAMAS 2016.
4. Verifying Multi-Agent Systems by Model Checking Three-valued Abstractions, Alessio Lomuscio and Jakub Michaliszyn, AAMAS 2015.
5. Decidability of model checking multi-agent systems against a class of EHS specifications, Alessio Lomuscio and Jakub Michaliszyn, ECAI 2014.
6. An abstraction technique for the verification of multi-agent systems against ATL specifications, Alessio Lomuscio and Jakub Michaliszyn, KR 2014.
7. Model Checking Unbounded Artifact-Centric Systems, Alessio Lomuscio and Jakub Michaliszyn, KR 2014.
8. An Epistemic Halpern–Shoham Logic, Alessio Lomuscio and Jakub Michaliszyn, IJCAI 2013.

II. Automata learning

1. Reachability and Bounded Emptiness Problems of Constraint Automata with Prefix, Suffix and Infix, Jakub Michaliszyn, Jan Otop, Piotr Wieczorek, CONCUR 2023
2. Deterministic Weighted Automata under Partial Observability, Jakub Michaliszyn, Jan Otop, JELIA 2023
3. Learning Deterministic Visibly Pushdown Automata Under Accessible Stack, Jakub Michaliszyn, Jan Otop, MFCS 2022
4. Minimization of Limit-Average Automata, Jakub Michaliszyn, Jan Otop, IJCAI 2021.
5. Learning Deterministic Automata on Infinite Words, Jakub Michaliszyn, Jan Otop, ECAI 2020.
6. Non-deterministic weighted automata evaluated over Markov chains, Jakub Michaliszyn, Jan Otop, J. Comput. Syst. Sci. 108: 118-136 2020.
7. Approximate Learning of Limit-Average Automata, Jakub Michaliszyn, Jan Otop, CONCUR 2019.
8. Non-deterministic Weighted Automata on Random Words, Jakub Michaliszyn, Jan Otop, CONCUR 2018.
9. Average Stack Cost of Büchi Pushdown Automata, Jakub Michaliszyn, Jan Otop, FSTTCS 2017.

III. Modal and interval temporal logic

1. "Most of" leads to undecidability: Failure of adding frequencies to LTL, Bartosz Bednarczyk, Jakub Michaliszyn, FoSSaCS 2021
2. Satisfiability versus Finite Satisfiability in Elementary Modal Logics, Jakub Michaliszyn, Jan Otop, Piotr Witkowski, Fundamenta Informaticae 163(2): 165-188, 2016.
3. On the Decidability of Elementary Modal Logics, Jakub Michaliszyn, Emanuel Kieroński and Jan Otop, ACM TOCL 2015.
4. The Undecidability of the Logic of Subintervals, Jerzy Marcinkowski and Jakub Michaliszyn, Fundamenta Informaticae 2014.
5. Elementary Modal Logics over Transitive Structures, Jakub Michaliszyn and Jan Otop, CSL 2013.
6. Decidability of modal logics with particular emphasis on the interval temporal logics, PhD thesis, 2012.
7. Satisfiability vs. Finite Satisfiability in Elementary Modal Logics (journal version), Jakub Michaliszyn, Jan Otop and Piotr Witkowski, in review.
8. Satisfiability vs. Finite Satisfiability in Elementary Modal Logics, Jakub Michaliszyn, Jan Otop and Piotr Witkowski, GANDALF 2012.
9. Finite Satisfiability of Modal Logic over Horn Definable Classes of Frames, Jakub Michaliszyn and Emanuel Kieroński, AIML 2012.
10. Decidable Elementary Modal Logics, Jakub Michaliszyn and Jan Otop, LICS 2012.
11. Modal Logics Definable by Universal Formulas with Three-Variables, Emanuel Kieroński, Jakub Michaliszyn and Jan Otop, FSTTCS 2011.
12. The Ultimate Undecidability Result for the Halpern-Shoham Logic, Jerzy Marcinkowski and Jakub Michaliszyn, LICS 2011.
13. B and D are enough to make the Halpern-Shoham logic undecidable, Jerzy Marcinkowski, Jakub Michaliszyn and Emanuel Kieroński, ICALP 2010.

IV. First-order logic

1. Two-variable Universal Logic with Transitive Closure, Emanuel Kieroński and Jakub Michaliszyn, CSL 2012.
2. Two-variable First-Order Logic with Equivalence Closure (journal version), Emanuel Kieroński, Jakub Michaliszyn, Ian Pratt-Hartmann, and Lidia Tendera, SIAM Journal on Computing 2014.
3. Two-variable First-order Logic with Equivalence Closure, Emanuel Kieroński, Jakub Michaliszyn, Ian Pratt-Hartmann and Lidia Tendera, LICS 2012.
4. Decidability of the Guarded Fragment with the Transitive Closure, Jakub Michaliszyn, ICALP 2009.
5. Konstrukcje PDL w logice ze strażnikami (in Polish), Jakub Michaliszyn, MSc thesis, 2008.

V. Others

1. Querying Best Paths in Graph Databases, Jakub Michaliszyn, Jan Otop, Piotr Wieczorek, FSTTCS 2017.
2. Querying Data Graphs with Arithmetical Regular Expressions, Maciej Graboń, Jakub Michaliszyn, Jan Otop, Piotr Wieczorek, IJCAI 2016.
3. On Injective Embeddings of Tree Patterns, Jakub Michaliszyn, Anca Muscholl, Sławek Staworko, Piotr Wieczorek, Zhilin Wu, 2012.
4. The cost of being co-Büchi is nonlinear, Jerzy Marcinkowski and Jakub Michaliszyn, 2009.