| 2025 | JELIA | Alternating-Time Temporal Logic with Default Actions. | Jakub Michaliszyn |
| 2025 | MFCS | Minimization of Deterministic Finite Automata Modulo the Edit Distance. | Jakub Michaliszyn, Jan Otop |
| 2023 | CONCUR | Reachability and Bounded Emptiness Problems of Constraint Automata with Prefix, Suffix and Infix. | Jakub Michaliszyn, Jan Otop, Piotr Wieczorek |
| 2023 | JELIA | Deterministic Weighted Automata Under Partial Observability. | Jakub Michaliszyn, Jan Otop |
| 2022 | MFCS | Learning Deterministic Visibly Pushdown Automata Under Accessible Stack. | Jakub Michaliszyn, Jan Otop |
| 2021 | FOSSACS | "Most of" leads to undecidability: Failure of adding frequencies to LTL. | Bartosz Bednarczyk, Jakub Michaliszyn |
| 2021 | IJCAI | Minimization of Limit-Average Automata. | Jakub Michaliszyn, Jan Otop |
| 2020 | ECAI | Learning Deterministic Automata on Infinite Words. | Jakub Michaliszyn, Jan Otop |
| 2019 | CONCUR | Approximate Learning of Limit-Average Automata. | Jakub Michaliszyn, Jan Otop |
| 2019 | IJCAI | Decidability of Model Checking Multi-Agent Systems with Regular Expressions against Epistemic HS Specifications. | Jakub Michaliszyn, Piotr Witkowski |
| 2018 | CONCUR | Non-deterministic Weighted Automata on Random Words. | Jakub Michaliszyn, Jan Otop |
| 2016 | ECAI | Agent-Based Refinement for Predicate Abstraction of Multi-Agent Systems. | Francesco Belardinelli, Alessio Lomuscio, Jakub Michaliszyn |
| 2016 | IJCAI | Querying Data Graphs with Arithmetical Regular Expressions. | Maciej Grabon, Jakub Michaliszyn, Jan Otop, Piotr Wieczorek |
| 2016 | KR | Model Checking Multi-Agent Systems against Epistemic HS Specifications with Regular Expressions. | Alessio Lomuscio, Jakub Michaliszyn |
| 2014 | ECAI | Decidability of model checking multi-agent systems against a class of EHS specifications. | Alessio R. Lomuscio, Jakub Michaliszyn |
| 2014 | KR | An Abstraction Technique for the Verification of Multi-Agent Systems Against ATL Specifications. | Alessio Lomuscio, Jakub Michaliszyn |
| 2014 | KR | Model Checking Unbounded Artifact-Centric Systems. | Alessio Lomuscio, Jakub Michaliszyn |
| 2013 | CSL | Elementary Modal Logics over Transitive Structures. | Jakub Michaliszyn, Jan Otop |
| 2013 | IJCAI | An Epistemic Halpern-Shoham Logic. | Alessio Lomuscio, Jakub Michaliszyn |
| 2012 | AiML | Finite Satisfiability of Modal Logic over Horn~Definable Classes of Frames. | Jakub Michaliszyn, Emanuel Kieronski |
| 2012 | CSL | Two-Variable Universal Logic with Transitive Closure. | Emanuel Kieronski, Jakub Michaliszyn |
| 2012 | LICS | Two-Variable First-Order Logic with Equivalence Closure. | Emanuel Kieronski, Jakub Michaliszyn, Ian Pratt-Hartmann, Lidia Tendera |
| 2012 | LICS | Decidable Elementary Modal Logics. | Jakub Michaliszyn, Jan Otop |
| 2011 | LICS | The Ultimate Undecidability Result for the Halpern-Shoham Logic. | Jerzy Marcinkowski, Jakub Michaliszyn |
| 2010 | ICALP | B and D Are Enough to Make the Halpern-Shoham Logic Undecidable. | Jerzy Marcinkowski, Jakub Michaliszyn, Emanuel Kieronski |
| 2009 | ICALP | Decidability of the Guarded Fragment with the Transitive Closure. | Jakub Michaliszyn |