Jakub Michaliszyn

Publication Activity (10 Years)

Years Active: 2009-2024
Publications (10 Years): 27

Top Topics

Deterministic Automata

Regular Expressions

Top Venues

Publications

Jakub Michaliszyn, Jan Otop
Deterministic Weighted Automata under Partial Observability. CoRR (2024)
Jakub Michaliszyn, Jan Otop
Deterministic Weighted Automata Under Partial Observability. JELIA (2023)
Jakub Michaliszyn, Jan Otop, Piotr Wieczorek
Reachability and Bounded Emptiness Problems of Constraint Automata with Prefix, Suffix and Infix. CONCUR (2023)
Jakub Michaliszyn, Jan Otop
Learning infinite-word automata with loop-index queries. Artif. Intell. 307 (2022)
Jakub Michaliszyn, Jan Otop
Learning Deterministic Visibly Pushdown Automata Under Accessible Stack. MFCS (2022)
Jakub Michaliszyn, Jan Otop
Minimization of Limit-Average Automata. IJCAI (2021)
Bartosz Bednarczyk, Jakub Michaliszyn
"Most of" leads to undecidability: Failure of adding frequencies to LTL. FoSSaCS (2021)
Jakub Michaliszyn, Jan Otop, Piotr Wieczorek
Modular Path Queries with Arithmetic. Log. Methods Comput. Sci. 17 (3) (2021)
Jakub Michaliszyn, Jan Otop
Learning Deterministic Automata on Infinite Words. ECAI (2020)
Jakub Michaliszyn, Jan Otop
Non-deterministic weighted automata evaluated over Markov chains. J. Comput. Syst. Sci. 108 (2020)
Bartosz Bednarczyk, Jakub Michaliszyn
"Most of" leads to undecidability: Failure of adding frequencies to LTL. CoRR (2020)
Jakub Michaliszyn, Jan Otop, Piotr Wieczorek
Modular Path Queries with Arithmetic. CoRR (2020)
Jakub Michaliszyn, Jan Otop
Non-deterministic weighted automata evaluated over Markov chains. CoRR (2019)
Jakub Michaliszyn, Piotr Witkowski
Decidability of Model Checking Multi-Agent Systems with Regular Expressions against Epistemic HS Specifications. IJCAI (2019)
Jakub Michaliszyn, Jan Otop
Approximate Learning of Limit-Average Automata. CONCUR (2019)
Jakub Michaliszyn, Jan Otop
Approximate Learning of Limit-Average Automata. CoRR (2019)
Jakub Michaliszyn, Jan Otop, Piotr Witkowski
Satisfiability versus Finite Satisfiability in Elementary Modal Logics. Fundam. Informaticae 163 (2) (2018)
Jakub Michaliszyn
Elementary Multimodal Logics. CoRR (2018)
Jakub Michaliszyn, Jan Otop
Non-deterministic Weighted Automata on Random Words. CONCUR (2018)
Jakub Michaliszyn, Jan Otop
Average Stack Cost of Büchi Pushdown Automata. FSTTCS (2017)
Jakub Michaliszyn, Jan Otop, Piotr Wieczorek
Querying Best Paths in Graph Databases. FSTTCS (2017)
Jakub Michaliszyn, Jan Otop, Piotr Wieczorek
Querying Best Paths in Graph Databases. CoRR (2017)
Jakub Michaliszyn, Jan Otop
Average Stack Cost of Buechi Pushdown Automata. CoRR (2017)
Alessio Lomuscio, Jakub Michaliszyn
Model Checking Multi-Agent Systems against Epistemic HS Specifications with Regular Expressions. KR (2016)
Alessio Lomuscio, Jakub Michaliszyn
Verification of Multi-Agent Systems via Predicate Abstraction against ATLK Specifications. AAMAS (2016)
Francesco Belardinelli, Alessio Lomuscio, Jakub Michaliszyn
Agent-Based Refinement for Predicate Abstraction of Multi-Agent Systems. ECAI (2016)
Maciej Grabon, Jakub Michaliszyn, Jan Otop, Piotr Wieczorek
Querying Data Graphs with Arithmetical Regular Expressions. IJCAI (2016)
Alessio Lomuscio, Jakub Michaliszyn
Verifying Multi-Agent Systems by Model Checking Three-valued Abstractions. AAMAS (2015)
Jakub Michaliszyn, Jan Otop, Emanuel Kieronski
On the Decidability of Elementary Modal Logics. ACM Trans. Comput. Log. 17 (1) (2015)
Alessio Lomuscio, Jakub Michaliszyn
Model Checking Epistemic Halpern-Shoham Logic Extended with Regular Expressions. CoRR (2015)
Jerzy Marcinkowski, Jakub Michaliszyn
The Undecidability of the Logic of Subintervals. Fundam. Informaticae 131 (2) (2014)
Emanuel Kieronski, Jakub Michaliszyn, Ian Pratt-Hartmann, Lidia Tendera
Two-Variable First-Order Logic with Equivalence Closure. SIAM J. Comput. 43 (3) (2014)
Alessio R. Lomuscio, Jakub Michaliszyn
Decidability of model checking multi-agent systems against a class of EHS specifications. ECAI (2014)
Alessio Lomuscio, Jakub Michaliszyn
An Abstraction Technique for the Verification of Multi-Agent Systems Against ATL Specifications. KR (2014)
Alessio Lomuscio, Jakub Michaliszyn
Model Checking Unbounded Artifact-Centric Systems. KR (2014)
Alessio Lomuscio, Jakub Michaliszyn
An Epistemic Halpern-Shoham Logic. IJCAI (2013)
Jakub Michaliszyn, Jan Otop
Elementary Modal Logics over Transitive Structures. CSL (2013)
Jakub Michaliszyn, Emanuel Kieronski
Finite Satisfiability of Modal Logic over Horn~Definable Classes of Frames. Advances in Modal Logic (2012)
Jakub Michaliszyn, Jan Otop
Decidable Elementary Modal Logics. LICS (2012)
Emanuel Kieronski, Jakub Michaliszyn
Two-Variable Universal Logic with Transitive Closure. CSL (2012)
Jakub Michaliszyn, Jan Otop, Piotr Witkowski
Satisfiability vs. Finite Satisfiability in Elementary Modal Logics GandALF (2012)
Jakub Michaliszyn, Anca Muscholl, Slawek Staworko, Piotr Wieczorek, Zhilin Wu
On Injective Embeddings of Tree Patterns CoRR (2012)
Emanuel Kieronski, Jakub Michaliszyn, Ian Pratt-Hartmann, Lidia Tendera
Two-Variable First-Order Logic with Equivalence Closure. LICS (2012)
Jerzy Marcinkowski, Jakub Michaliszyn
The Ultimate Undecidability Result for the Halpern-Shoham Logic. LICS (2011)
Emanuel Kieronski, Jakub Michaliszyn, Jan Otop
Modal Logics Definable by Universal Three-Variable Formulas. FSTTCS (2011)
Jerzy Marcinkowski, Jakub Michaliszyn, Emanuel Kieronski
B and D Are Enough to Make the Halpern-Shoham Logic Undecidable. ICALP (2) (2010)
Jerzy Marcinkowski, Jakub Michaliszyn
The Last Paper on the Halpern-Shoham Interval Temporal Logic CoRR (2010)
Jakub Michaliszyn
Decidability of the Guarded Fragment with the Transitive Closure. ICALP (2) (2009)
Jerzy Marcinkowski, Jakub Michaliszyn
The cost of being co-Buchi is nonlinear CoRR (2009)