# Jakub Michaliszyn

According to our database

Collaborative distances:

^{1}, Jakub Michaliszyn authored at least 32 papers between 2009 and 2018.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2018

Elementary Multimodal Logics.

CoRR, 2018

Non-deterministic Weighted Automata on Random Words.

Proceedings of the 29th International Conference on Concurrency Theory, 2018

2017

Average Stack Cost of Buechi Pushdown Automata.

CoRR, 2017

Querying Best Paths in Graph Databases.

CoRR, 2017

Querying Best Paths in Graph Databases.

Proceedings of the 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2017

Average Stack Cost of Büchi Pushdown Automata.

Proceedings of the 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2017

2016

Model Checking Multi-Agent Systems against Epistemic HS Specifications with Regular Expressions.

Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Fifteenth International Conference, 2016

Querying Data Graphs with Arithmetical Regular Expressions.

Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Agent-Based Refinement for Predicate Abstraction of Multi-Agent Systems.

Proceedings of the ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands, 2016

Verification of Multi-Agent Systems via Predicate Abstraction against ATLK Specifications.

Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, 2016

2015

On the Decidability of Elementary Modal Logics.

ACM Trans. Comput. Log., 2015

Model Checking Epistemic Halpern-Shoham Logic Extended with Regular Expressions.

CoRR, 2015

Verifying Multi-Agent Systems by Model Checking Three-valued Abstractions.

Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

2014

Two-Variable First-Order Logic with Equivalence Closure.

SIAM J. Comput., 2014

The Undecidability of the Logic of Subintervals.

Fundam. Inform., 2014

Model Checking Unbounded Artifact-Centric Systems.

Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Fourteenth International Conference, 2014

An Abstraction Technique for the Verification of Multi-Agent Systems Against ATL Specifications.

Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Fourteenth International Conference, 2014

Decidability of model checking multi-agent systems against a class of EHS specifications.

Proceedings of the ECAI 2014 - 21st European Conference on Artificial Intelligence, 18-22 August 2014, Prague, Czech Republic, 2014

2013

An Epistemic Halpern-Shoham Logic.

Proceedings of the IJCAI 2013, 2013

Elementary Modal Logics over Transitive Structures.

Proceedings of the Computer Science Logic 2013 (CSL 2013), 2013

2012

Satisfiability vs. Finite Satisfiability in Elementary Modal Logics

Proceedings of the Proceedings Third International Symposium on Games, 2012

On Injective Embeddings of Tree Patterns

CoRR, 2012

Decidable Elementary Modal Logics.

Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, 2012

Two-Variable First-Order Logic with Equivalence Closure.

Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, 2012

Two-Variable Universal Logic with Transitive Closure.

Proceedings of the Computer Science Logic (CSL'12), 2012

Finite Satisfiability of Modal Logic over Horn~Definable Classes of Frames.

Proceedings of the Advances in Modal Logic 9, 2012

2011

The Ultimate Undecidability Result for the Halpern-Shoham Logic.

Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science, 2011

Modal Logics Definable by Universal Three-Variable Formulas.

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2011

2010

The Last Paper on the Halpern-Shoham Interval Temporal Logic

CoRR, 2010

B and D Are Enough to Make the Halpern-Shoham Logic Undecidable.

Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

2009

The cost of being co-Buchi is nonlinear

CoRR, 2009

Decidability of the Guarded Fragment with the Transitive Closure.

Proceedings of the Automata, Languages and Programming, 36th Internatilonal Colloquium, 2009