Jakub Michaliszyn

Piotr Witkowski

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Approximate Learning of Limit-Average Automata.

[BibT_eX]

[DOI]

Proceedings of the 30th International Conference on Concurrency Theory, 2019

2018

Satisfiability versus Finite Satisfiability in Elementary Modal Logics.

[BibT_eX]

[DOI]

Piotr Witkowski

Fundam. Informaticae, 2018

Elementary Multimodal Logics.

[BibT_eX]

[DOI]

CoRR, 2018

Non-deterministic Weighted Automata on Random Words.

[BibT_eX]

[DOI]

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

2017

Average Stack Cost of Buechi Pushdown Automata.

[BibT_eX]

[DOI]

CoRR, 2017

Querying Best Paths in Graph Databases.

[BibT_eX]

[DOI]

Piotr Wieczorek

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.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

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

Querying Data Graphs with Arithmetical Regular Expressions.

[BibT_eX]

[DOI]

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

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

[BibT_eX]

[DOI]

Francesco Belardinelli

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.

[BibT_eX]

[DOI]

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

2015

On the Decidability of Elementary Modal Logics.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2015

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

[BibT_eX]

[DOI]

CoRR, 2015

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

[BibT_eX]

[DOI]

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

2014

Two-Variable First-Order Logic with Equivalence Closure.

[BibT_eX]

[DOI]

SIAM J. Comput., 2014

The Undecidability of the Logic of Subintervals.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2014

Model Checking Unbounded Artifact-Centric Systems.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Alessio R. Lomuscio

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.

[BibT_eX]

[DOI]

Proceedings of the IJCAI 2013, 2013

Elementary Modal Logics over Transitive Structures.

[BibT_eX]

[DOI]

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

2012

Satisfiability vs. Finite Satisfiability in Elementary Modal Logics

[BibT_eX]

[DOI]

Piotr Witkowski

Proceedings of the Proceedings Third International Symposium on Games, 2012

On Injective Embeddings of Tree Patterns

[BibT_eX]

[DOI]

CoRR, 2012

Decidable Elementary Modal Logics.

[BibT_eX]

[DOI]

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

Two-Variable Universal Logic with Transitive Closure.

[BibT_eX]

[DOI]

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

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

[BibT_eX]

[DOI]

Proceedings of the Advances in Modal Logic 9, 2012

2011

The Ultimate Undecidability Result for the Halpern-Shoham Logic.

[BibT_eX]

[DOI]

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

Modal Logics Definable by Universal Three-Variable Formulas.

[BibT_eX]

[DOI]

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

[BibT_eX]

[DOI]

CoRR, 2010

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

[BibT_eX]

[DOI]

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

2009

The cost of being co-Buchi is nonlinear

[BibT_eX]

[DOI]

CoRR, 2009

Decidability of the Guarded Fragment with the Transitive Closure.

[BibT_eX]

[DOI]