Jakub Michaliszyn
Jakub Michaliszyn
Zweryfikowany adres z cs.uni.wroc.pl - Strona główna
Tytuł
Cytowane przez
Cytowane przez
Rok
An Epistemic Halpern–Shoham Logic
AR Lomuscio, J Michaliszyn
International Joint Conferences on Artificial Intelligence (IJCAI), 2013
652013
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
622012
The undecidability of the logic of subintervals
J Marcinkowski, J Michaliszyn
Fundamenta Informaticae 131 (2), 217-240, 2014
372014
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
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
33*
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
242016
Model Checking Multi-Agent Systems against Epistemic HS Specifications with Regular Expressions.
A Lomuscio, J Michaliszyn
KR, 298-308, 2016
232016
Verifying Multi-Agent Systems by Model Checking Three-valued Abstractions.
A Lomuscio, J Michaliszyn
AAMAS 15, 189-198, 2015
202015
Decidability of the Guarded Fragment with the Transitive Closure
J Michaliszyn
The 36th International Colloquium on Automata, Languages and Programming …, 2009
162009
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
152010
Agent-Based Refinement for Predicate Abstraction of Multi-Agent Systems.
F Belardinelli, A Lomuscio, J Michaliszyn
ECAI, 286-294, 2016
132016
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
132014
Two-Variable Universal Logic with Transitive Closure
E Kieroński, J Michaliszyn
The 21st EACSL Annual Conferences on Computer Science Logic, 2012
132012
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
Satisfiability vs. Finite Satisfiability in Elementary Modal Logics
J Michaliszyn, J Otop, P Witkowski
Gandalf 2012, 2012
52012
Non-deterministic weighted automata on random words
J Michaliszyn, J Otop
29th International Conference on Concurrency Theory (CONCUR 2018), 2018
42018
Model checking epistemic Halpern-Shoham logic extended with regular expressions
A Lomuscio, J Michaliszyn
arXiv preprint arXiv:1509.00608, 2015
32015
Elementary Modal Logics over Transitive Structures
J Michaliszyn, J Otop
The 22st EACSL Annual Conferences on Computer Science Logic, CSL 2013 23 …, 2013
32013
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20