| An Epistemic Halpern–Shoham Logic AR Lomuscio, J Michaliszyn International Joint Conferences on Artificial Intelligence (IJCAI), 2013 | 71 | 2013 |
| Two-variable first-order logic with equivalence closure E Kieronski, J Michaliszyn, I Pratt-Hartmann, L Tendera 27th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 431-440, 2012 | 66 | 2012 |
| The undecidability of the logic of subintervals J Marcinkowski, J Michaliszyn Fundamenta Informaticae 131 (2), 217-240, 2014 | 50 | 2014 |
| Decidability of model checking multi-agent systems against a class of EHS specifications AR Lomuscio, J Michaliszyn 21st European Conference on Artificial Intelligence (ECAI) 8, 543-548, 0 | 39* | |
| The ultimate undecidability result for the Halpern-Shoham logic J Marcinkowski, J Michaliszyn 2011 IEEE 26th Annual Symposium on Logic in Computer Science, 377-386, 2011 | 35 | 2011 |
| Model Checking Multi-Agent Systems against Epistemic HS Specifications with Regular Expressions. A Lomuscio, J Michaliszyn KR, 298-308, 2016 | 31 | 2016 |
| Verification of multi-agent systems via predicate abstraction against ATLK specifications A Lomuscio, J Michliszyn Proceedings of the 2016 International Conference on Autonomous Agents …, 2016 | 27 | 2016 |
| Verifying multi-agent systems by model checking three-valued abstractions A Lomuscio, J Michaliszyn Proceedings of the 2015 International Conference on Autonomous Agents and …, 2015 | 26 | 2015 |
| B and D Are Enough to Make the Halpern–Shoham Logic Undecidable J Marcinkowski, J Michaliszyn, E Kieroński The 37th International Colloquium on Automata, Languages and Programming …, 2010 | 17 | 2010 |
| Decidability of the Guarded Fragment with the Transitive Closure J Michaliszyn The 36th International Colloquium on Automata, Languages and Programming …, 2009 | 16 | 2009 |
| An Abstraction Technique for the Verification of Multi-agent Systems against ATL Specifications A Lomuscio, J Michaliszyn 14th International Conference on Principles of Knowledge Representation and …, 2014 | 15 | 2014 |
| Agent-Based Refinement for Predicate Abstraction of Multi-Agent Systems. F Belardinelli, A Lomuscio, J Michaliszyn ECAI, 286-294, 2016 | 14 | 2016 |
| Two-Variable Universal Logic with Transitive Closure E Kieroński, J Michaliszyn The 21st EACSL Annual Conferences on Computer Science Logic, 2012 | 13 | 2012 |
| Learning deterministic automata on infinite words J Michaliszyn, J Otop ECAI 2020, 2370-2377, 2020 | 10 | 2020 |
| Decidable elementary modal logics J Michaliszyn, J Otop 27th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) 27, 491-500, 2012 | 9 | 2012 |
| Modal Logics Definable by Universal Three-Variable Formulas E Kieronski, J Michaliszyn, J Otop IARCS Annual Conference on Foundations of Software Technology and …, 2011 | 9 | 2011 |
| Model Checking Unbounded Artifact-Centric Systems A Lomuscio, J Michaliszyn 14th International Conference on Principles of Knowledge Representation and …, 2014 | 7 | 2014 |
| Satisfiability vs. Finite Satisfiability in Elementary Modal Logics J Michaliszyn, J Otop, P Witkowski Gandalf 2012, 2012 | 5 | 2012 |
| Approximate learning of limit-average automata J Michaliszyn, J Otop arXiv preprint arXiv:1906.11104, 2019 | 4 | 2019 |
| Non-deterministic weighted automata on random words J Michaliszyn, J Otop 29th International Conference on Concurrency Theory (CONCUR 2018), 2018 | 4 | 2018 |
Jan OtopUniversity of WrocławZweryfikowany adres z cs.uni.wroc.pl
