Decidability of the Guarded Fragment with the Transitive Closure. - Jakub Michaliszyn (ICALP (2), 2009)

The cost of being co-Buchi is nonlinear - Jerzy Marcinkowski; Jakub Michaliszyn (CoRR, 2009)

B and D Are Enough to Make the Halpern-Shoham Logic Undecidable. - Jerzy Marcinkowski; Jakub Michaliszyn; Emanuel Kieronski (ICALP (2), 2010)

The Last Paper on the Halpern-Shoham Interval Temporal Logic - Jerzy Marcinkowski; Jakub Michaliszyn (CoRR, 2010)

Modal Logics Definable by Universal Three-Variable Formulas. - Emanuel Kieronski; Jakub Michaliszyn; Jan Otop (FSTTCS, 2011)

The Ultimate Undecidability Result for the Halpern-Shoham Logic. - Jerzy Marcinkowski; Jakub Michaliszyn (LICS, 2011)

Finite Satisfiability of Modal Logic over Horn Definable Classes of Frames. - Jakub Michaliszyn; Emanuel Kieronski (Advances in Modal Logic, 2012)

Two-Variable Universal Logic with Transitive Closure. - Emanuel Kieronski; Jakub Michaliszyn (CSL, 2012)

Decidable Elementary Modal Logics. - Jakub Michaliszyn; Jan Otop (LICS, 2012)

On Injective Embeddings of Tree Patterns - Jakub Michaliszyn; Anca Muscholl; Slawek Staworko; Piotr Wieczorek; Zhilin Wu (CoRR, 2012)

Satisfiability vs. Finite Satisfiability in Elementary Modal Logics - Jakub Michaliszyn; Jan Otop; Piotr Witkowski 001 (GandALF, 2012)

Elementary Modal Logics over Transitive Structures. - Jakub Michaliszyn; Jan Otop (CSL, 2013)

An Epistemic Halpern-Shoham Logic. - Alessio Lomuscio; Jakub Michaliszyn (IJCAI, 2013)

Decidability of model checking multi-agent systems against a class of EHS specifications. - Alessio R. Lomuscio; Jakub Michaliszyn (ECAI, 2014)

An Abstraction Technique for the Verification of Multi-Agent Systems Against ATL Specifications. - Alessio Lomuscio; Jakub Michaliszyn (KR, 2014)

Model Checking Unbounded Artifact-Centric Systems. - Alessio Lomuscio; Jakub Michaliszyn (KR, 2014)

The Undecidability of the Logic of Subintervals. - Jerzy Marcinkowski; Jakub Michaliszyn (Fundam. Informaticae, 2014)

Two-Variable First-Order Logic with Equivalence Closure. - Emanuel Kieronski; Jakub Michaliszyn; Ian Pratt-Hartmann; Lidia Tendera (SIAM J. Comput., 2014)

Verifying Multi-Agent Systems by Model Checking Three-valued Abstractions. - Alessio Lomuscio; Jakub Michaliszyn (AAMAS, 2015)

Model Checking Epistemic Halpern-Shoham Logic Extended with Regular Expressions. - Alessio Lomuscio; Jakub Michaliszyn (CoRR, 2015)

On the Decidability of Elementary Modal Logics. - Jakub Michaliszyn; Jan Otop; Emanuel Kieronski (ACM Trans. Comput. Log., 2015)

Verification of Multi-Agent Systems via Predicate Abstraction against ATLK Specifications. - Alessio Lomuscio; Jakub Michaliszyn (AAMAS, 2016)

Agent-Based Refinement for Predicate Abstraction of Multi-Agent Systems. - Francesco Belardinelli; Alessio Lomuscio; Jakub Michaliszyn (ECAI, 2016)

Querying Data Graphs with Arithmetical Regular Expressions. - Maciej Grabon; Jakub Michaliszyn; Jan Otop; Piotr Wieczorek (IJCAI, 2016)

Model Checking Multi-Agent Systems against Epistemic HS Specifications with Regular Expressions. - Alessio Lomuscio; Jakub Michaliszyn (KR, 2016)

Average Stack Cost of Büchi Pushdown Automata. - Jakub Michaliszyn; Jan Otop (FSTTCS, 2017)

Querying Best Paths in Graph Databases. - Jakub Michaliszyn; Jan Otop; Piotr Wieczorek (FSTTCS, 2017)

Average Stack Cost of Buechi Pushdown Automata. - Jakub Michaliszyn; Jan Otop (CoRR, 2017)

Non-deterministic Weighted Automata on Random Words. - Jakub Michaliszyn; Jan Otop (CONCUR, 2018)

Elementary Multimodal Logics. - Jakub Michaliszyn (CoRR, 2018)

Satisfiability versus Finite Satisfiability in Elementary Modal Logics. - Jakub Michaliszyn; Jan Otop; Piotr Witkowski 001 (Fundam. Informaticae, 2018)

Approximate Learning of Limit-Average Automata. - Jakub Michaliszyn; Jan Otop (CONCUR, 2019)

Decidability of Model Checking Multi-Agent Systems with Regular Expressions against Epistemic HS Specifications. - Jakub Michaliszyn; Piotr Witkowski 001 (IJCAI, 2019)

Learning Deterministic Automata on Infinite Words. - Jakub Michaliszyn; Jan Otop (ECAI, 2020)

Non-deterministic weighted automata evaluated over Markov chains. - Jakub Michaliszyn; Jan Otop (J. Comput. Syst. Sci., 2020)

"Most of" leads to undecidability: Failure of adding frequencies to LTL. - Bartosz Bednarczyk; Jakub Michaliszyn (FoSSaCS, 2021)

Minimization of Limit-Average Automata. - Jakub Michaliszyn; Jan Otop (IJCAI, 2021)

Modular Path Queries with Arithmetic. - Jakub Michaliszyn; Jan Otop; Piotr Wieczorek (Log. Methods Comput. Sci., 2021)

Learning Deterministic Visibly Pushdown Automata Under Accessible Stack. - Jakub Michaliszyn; Jan Otop (MFCS, 2022)

Learning infinite-word automata with loop-index queries. - Jakub Michaliszyn; Jan Otop (Artif. Intell., 2022)

Reachability and Bounded Emptiness Problems of Constraint Automata with Prefix, Suffix and Infix. - Jakub Michaliszyn; Jan Otop; Piotr Wieczorek (CONCUR, 2023)

Deterministic Weighted Automata Under Partial Observability. - Jakub Michaliszyn; Jan Otop (JELIA, 2023)

Alternating-Time Temporal Logic with Default Actions. - Jakub Michaliszyn (JELIA (2), 2025)

Minimization of Deterministic Finite Automata Modulo the Edit Distance. - Jakub Michaliszyn; Jan Otop (MFCS, 2025)