Follow
Jakub Michaliszyn
Jakub Michaliszyn
Verified email at cs.uni.wroc.pl - Homepage
Title
Cited by
Cited by
Year
An Epistemic Halpern–Shoham Logic
AR Lomuscio, J Michaliszyn
International Joint Conferences on Artificial Intelligence (IJCAI), 2013
752013
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
752012
The undecidability of the logic of subintervals
J Marcinkowski, J Michaliszyn
Fundamenta Informaticae 131 (2), 217-240, 2014
542014
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
43*
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
352011
Model checking multi-agent systems against epistemic HS specifications with regular expressions
A Lomuscio, J Michaliszyn
Fifteenth International Conference on the Principles of Knowledge …, 2016
342016
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
302015
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
272016
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
162014
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
162010
Decidability of the Guarded Fragment with the Transitive Closure
J Michaliszyn
The 36th International Colloquium on Automata, Languages and Programming …, 2009
162009
Agent-based refinement for predicate abstraction of multi-agent systems
F Belardinelli, A Lomuscio, J Michaliszyn
ECAI 2016, 286-294, 2016
152016
Two-Variable Universal Logic with Transitive Closure
E Kieroński, J Michaliszyn
The 21st EACSL Annual Conferences on Computer Science Logic, 2012
142012
Learning deterministic automata on infinite words
J Michaliszyn, J Otop
ECAI 2020, 2370-2377, 2020
102020
Decidable elementary modal logics
J Michaliszyn, J Otop
27th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) 27, 491-500, 2012
92012
Modal Logics Definable by Universal Three-Variable Formulas
E Kieronski, J Michaliszyn, J Otop
IARCS Annual Conference on Foundations of Software Technology and …, 2011
92011
Model Checking Unbounded Artifact-Centric Systems
A Lomuscio, J Michaliszyn
14th International Conference on Principles of Knowledge Representation and …, 2014
72014
Non-deterministic weighted automata evaluated over Markov chains
J Michaliszyn, J Otop
Journal of Computer and System Sciences 108, 118-136, 2020
52020
Satisfiability vs. Finite Satisfiability in Elementary Modal Logics
J Michaliszyn, J Otop, P Witkowski
Gandalf 2012, 2012
52012
Learning infinite-word automata with loop-index queries
J Michaliszyn, J Otop
Artificial Intelligence 307, 103710, 2022
42022
The system can't perform the operation now. Try again later.
Articles 1–20