Computer Science · University of Wrocław

Jakub Michaliszyn

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: jakub.michaliszyn at gmail.com

Jakub Michaliszyn

Publications

Peer-reviewed publications, newest first.

  1. Alternating-Time Temporal Logic with Default Actions

    Jakub Michaliszyn · JELIA 2025

  2. Minimization of Deterministic Finite Automata Modulo the Edit Distance

    Jakub Michaliszyn, Jan Otop · MFCS 2025

  3. Deterministic Weighted Automata Under Partial Observability

    Jakub Michaliszyn, Jan Otop · JELIA 2023

  4. Reachability and Bounded Emptiness Problems of Constraint Automata with Prefix, Suffix and Infix

    Jakub Michaliszyn, Jan Otop, Piotr Wieczorek · CONCUR 2023

  5. Learning Deterministic Visibly Pushdown Automata Under Accessible Stack

    Jakub Michaliszyn, Jan Otop · MFCS 2022

  6. Learning infinite-word automata with loop-index queries

    Jakub Michaliszyn, Jan Otop · Artificial Intelligence 307, 103710

  7. Modular Path Queries with Arithmetic

    Jakub Michaliszyn, Jan Otop, Piotr Wieczorek · Logical Methods in Computer Science 17(3)

  8. Minimization of Limit-Average Automata

    Jakub Michaliszyn, Jan Otop · IJCAI 2021

  9. “Most of” leads to undecidability: Failure of adding frequencies to LTL

    Bartosz Bednarczyk, Jakub Michaliszyn · FoSSaCS 2021

  10. Learning Deterministic Automata on Infinite Words

    Jakub Michaliszyn, Jan Otop · ECAI 2020

  11. Non-deterministic weighted automata evaluated over Markov chains

    Jakub Michaliszyn, Jan Otop · Journal of Computer and System Sciences 108, 118–136

  12. Decidability of Model Checking Multi-Agent Systems with Regular Expressions against Epistemic HS Specifications

    Jakub Michaliszyn, Piotr Witkowski · IJCAI 2019

  13. Approximate Learning of Limit-Average Automata

    Jakub Michaliszyn, Jan Otop · CONCUR 2019

  14. Satisfiability versus Finite Satisfiability in Elementary Modal Logics

    Jakub Michaliszyn, Jan Otop, Piotr Witkowski · Fundamenta Informaticae 163(2), 165–188

  15. Non-deterministic Weighted Automata on Random Words

    Jakub Michaliszyn, Jan Otop · CONCUR 2018

  16. Querying Best Paths in Graph Databases

    Jakub Michaliszyn, Jan Otop, Piotr Wieczorek · FSTTCS 2017

  17. Average Stack Cost of Büchi Pushdown Automata

    Jakub Michaliszyn, Jan Otop · FSTTCS 2017

  18. Agent-Based Refinement for Predicate Abstraction of Multi-Agent Systems

    Francesco Belardinelli, Alessio Lomuscio, Jakub Michaliszyn · ECAI 2016

  19. Model Checking Multi-Agent Systems against Epistemic HS Specifications with Regular Expressions

    Alessio Lomuscio, Jakub Michaliszyn · KR 2016

  20. Verification of Multi-Agent Systems via Predicate Abstraction against ATLK Specifications

    Alessio Lomuscio, Jakub Michaliszyn · AAMAS 2016

  21. Querying Data Graphs with Arithmetical Regular Expressions

    Maciej Graboń, Jakub Michaliszyn, Jan Otop, Piotr Wieczorek · IJCAI 2016

  22. On the Decidability of Elementary Modal Logics

    Jakub Michaliszyn, Jan Otop, Emanuel Kieroński · ACM Transactions on Computational Logic 17(1)

  23. Verifying Multi-Agent Systems by Model Checking Three-valued Abstractions

    Alessio Lomuscio, Jakub Michaliszyn · AAMAS 2015

  24. Two-Variable First-Order Logic with Equivalence Closure

    Emanuel Kieroński, Jakub Michaliszyn, Ian Pratt-Hartmann, Lidia Tendera · SIAM Journal on Computing 43(3), 1012–1063

  25. The Undecidability of the Logic of Subintervals

    Jerzy Marcinkowski, Jakub Michaliszyn · Fundamenta Informaticae

  26. Model Checking Unbounded Artifact-Centric Systems

    Alessio Lomuscio, Jakub Michaliszyn · KR 2014

  27. An Abstraction Technique for the Verification of Multi-Agent Systems Against ATL Specifications

    Alessio Lomuscio, Jakub Michaliszyn · KR 2014

  28. Decidability of model checking multi-agent systems against a class of EHS specifications

    Alessio Lomuscio, Jakub Michaliszyn · ECAI 2014

  29. An Epistemic Halpern–Shoham Logic

    Alessio Lomuscio, Jakub Michaliszyn · IJCAI 2013

  30. Elementary Modal Logics over Transitive Structures

    Jakub Michaliszyn, Jan Otop · CSL 2013

  31. Satisfiability vs. Finite Satisfiability in Elementary Modal Logics

    Jakub Michaliszyn, Jan Otop, Piotr Witkowski · GANDALF 2012

  32. Finite Satisfiability of Modal Logic over Horn Definable Classes of Frames

    Jakub Michaliszyn, Emanuel Kieroński · AiML 2012

  33. Decidable Elementary Modal Logics

    Jakub Michaliszyn, Jan Otop · LICS 2012

  34. Two-Variable First-Order Logic with Equivalence Closure

    Emanuel Kieroński, Jakub Michaliszyn, Ian Pratt-Hartmann, Lidia Tendera · LICS 2012

  35. Two-Variable Universal Logic with Transitive Closure

    Emanuel Kieroński, Jakub Michaliszyn · CSL 2012

  36. Modal Logics Definable by Universal Three-Variable Formulas

    Emanuel Kieroński, Jakub Michaliszyn, Jan Otop · FSTTCS 2011

  37. The Ultimate Undecidability Result for the Halpern-Shoham Logic

    Jerzy Marcinkowski, Jakub Michaliszyn · LICS 2011

  38. B and D Are Enough to Make the Halpern-Shoham Logic Undecidable

    Jerzy Marcinkowski, Jakub Michaliszyn, Emanuel Kieroński · ICALP 2010

  39. Decidability of the Guarded Fragment with the Transitive Closure

    Jakub Michaliszyn · ICALP 2009

University of Wrocław · Institute of Computer Science