Jakub Michaliszyn A photo Research Associate at Imperial College London.
PhD in computer science in 2012.
A PC member of IJCAI'15, AAMAS'15, AIML'14 and ECAI'14 and an organizer of the LogIC Seminar.
My CV: PDF.
Contact: jakub.michaliszynat gmailgmail.com.

Papers (Scholar, BibTeX, PDF) I. Model checking
  1. Verifying Multi-Agent Systems by Model Checking Three-valued Abstractions, Alessio Lomuscio and Jakub Michaliszyn, AAMAS 2015.
  2. Decidability of model checking multi-agent systems against a class of EHS specifications, Alessio Lomuscio and Jakub Michaliszyn, ECAI 2014.
  3. An abstraction technique for the verification of multi-agent systems against ATL specifications, Alessio Lomuscio and Jakub Michaliszyn, KR 2014.
  4. Model Checking Unbounded Artifact-Centric Systems, Alessio Lomuscio and Jakub Michaliszyn, KR 2014.
  5. An Epistemic Halpern–Shoham Logic, Alessio Lomuscio and Jakub Michaliszyn, IJCAI 2013.
II. Modal logic
  1. On the Decidability of Elementary Modal Logics, Jakub Michaliszyn, Emanuel Kieroński and Jan Otop, accepted for ACM TOCL.
  2. Elementary Modal Logics over Transitive Structures, Jakub Michaliszyn and Jan Otop, CSL 2013.
  3. Elementary Modal Logics – Decidability and Complexity, Jakub Michaliszyn, Emanuel Kieroński and Jan Otop, HIGHLIGHTS 2013.
  4. On the Decidability of Elementary Modal Logics, Jakub Michaliszyn, Emanuel Kieroński and Jan Otop, in review.
  5. Satisfiability vs. Finite Satisfiability in Elementary Modal Logics (journal version), Jakub Michaliszyn, Jan Otop and Piotr Witkowski, in review.
  6. Satisfiability vs. Finite Satisfiability in Elementary Modal Logics, Jakub Michaliszyn, Jan Otop and Piotr Witkowski, GANDALF 2012.
  7. Finite Satisfiability of Modal Logic over Horn Definable Classes of Frames, Jakub Michaliszyn and Emanuel Kieroński, AIML 2012.
  8. Decidable Elementary Modal Logics, Jakub Michaliszyn and Jan Otop, LICS 2012.
  9. Modal Logics Definable by Universal Formulas with Three-Variables, Emanuel Kieroński, Jakub Michaliszyn and Jan Otop, FSTTCS 2011.
III. Interval temporal logic
  1. The Undecidability of the Logic of Subintervals, Jerzy Marcinkowski and Jakub Michaliszyn, Fundamenta Informaticae 2014.
  2. The Ultimate Undecidability Result for the Halpern-Shoham Logic, Jerzy Marcinkowski and Jakub Michaliszyn, LICS 2011.
  3. B and D are enough to make the Halpern-Shoham logic undecidable, Jerzy Marcinkowski, Jakub Michaliszyn and Emanuel Kieroński, ICALP 2010.
IV. First-order logic
  1. Two-variable Universal Logic with Transitive Closure, Emanuel Kieroński and Jakub Michaliszyn, CSL 2012.
  2. Two-variable First-Order Logic with Equivalence Closure (journal version), Emanuel Kieroński, Jakub Michaliszyn, Ian Pratt-Hartmann, and Lidia Tendera, SIAM Journal on Computing 2014.
  3. Two-variable First-order Logic with Equivalence Closure, Emanuel Kieroński, Jakub Michaliszyn, Ian Pratt-Hartmann and Lidia Tendera, LICS 2012.
  4. Decidability of the Guarded Fragment with the Transitive Closure, Jakub Michaliszyn, ICALP 2009.
V. Others
  1. Decidability of modal logics with particular emphasis on the interval temporal logics, PhD thesis, 2012.
  2. On Injective Embeddings of Tree Patterns, Jakub Michaliszyn, Anca Muscholl, Sławek Staworko, Piotr Wieczorek, Zhilin Wu, 2012.
  3. The cost of being co-Büchi is nonlinear, Jerzy Marcinkowski and Jakub Michaliszyn, 2009.
  4. Konstrukcje PDL w logice ze strażnikami (in Polish), Jakub Michaliszyn, MSc thesis, 2008.