Personal information

No personal information available

Activities

Collapse all

Employment (1)

University of Wrocław: Wrocław, PL

2015-10-01 to present
Employment
Source: Self-asserted source
Jakub Michaliszyn

Education and qualifications (2)

Uniwersytet Wroclawski: Wroclaw, PL

2008-10-01 to 2012-09-31 | PhD (Department of Computing)
Education
Source: Self-asserted source
Jakub Michaliszyn

Uniwersytet Wroclawski: Wroclaw, PL

2004-10-01 to 2008-06-23 | Master (Department of Computer Science)
Education
Source: Self-asserted source
Jakub Michaliszyn

Works (31)

Deterministic Weighted Automata Under Partial Observability

2023 | Book chapter
DOI: 10.1007/978-3-031-43619-2_52
Contributors: Jakub Michaliszyn; Jan Otop
Source: check_circle
Crossref

Learning infinite-word automata with loop-index queries

Artificial Intelligence
2022-06 | Journal article
DOI: 10.1016/j.artint.2022.103710
Contributors: Jakub Michaliszyn; Jan Otop
Source: check_circle
Crossref

Modular path queries with arithmetic

Logical Methods in Computer Science
2021 | Journal article
DOI: 10.46298/lmcs-17(3:27)2021
Part of ISSN: 1860-5974
Source: Self-asserted source
Jakub Michaliszyn
grade
Preferred source (of 2)‎

“Most of” leads to undecidability: failure of adding frequencies to LTL

Foundations of Software Science and Computation Structures : 24th International Conference, FOSSACS 2021, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2021, Luxembourg City, Luxembourg, March 27 – April 1, 2021, Proceedings
2021 | Conference paper
DOI: 10.1007/978-3-030-71995-1_5
Part of ISBN: 9783030719944
Source: Self-asserted source
Jakub Michaliszyn
grade
Preferred source (of 2)‎

Learning deterministic automata on infinite words

European Conference on Artificial Intelligence : 24th European Conference on Artificial Intelligence, ECAI 2020, 29 August–8 September 2020, Santiago de Compostela, Spain : including 10th Conference on Prestigious Applications of Artificial Intelligence (PAIS 2020). Proceedings
2020 | Conference paper
DOI: 10.3233/FAIA200367
Part of ISBN: 9781643681009
Source: Self-asserted source
Jakub Michaliszyn

Modular Path Queries with Arithmetic

CoRR
2020 | Journal article
URI:

https://arxiv.org/abs/2002.04460
Source: Self-asserted source
Jakub Michaliszyn

Non-deterministic weighted automata evaluated over Markov chains

Journal of Computer and System Sciences
2020-03 | Journal article
DOI: 10.1016/j.jcss.2019.10.001
Part of ISSN: 0022-0000
Source: Self-asserted source
Jakub Michaliszyn
grade
Preferred source (of 2)‎

Approximate learning of limit-average automata

30th International Conference on Concurrency Theory (CONCUR 2019)
2019 | Conference paper
DOI: 10.4230/LIPIcs.CONCUR.2019.17
Part of ISBN: 9783959771214
Source: Self-asserted source
Jakub Michaliszyn

Approximate Learning of Limit-Average Automata

CoRR
2019 | Journal article
URI:

http://arxiv.org/abs/1906.11104
Source: Self-asserted source
Jakub Michaliszyn

Non-deterministic weighted automata evaluated over Markov chains

CoRR
2019 | Journal article
URI:

http://arxiv.org/abs/1908.04625
Source: Self-asserted source
Jakub Michaliszyn

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

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence
2019-08 | Conference paper
DOI: 10.24963/ijcai.2019/659
Part of ISBN: 9780999241141
Source: Self-asserted source
Jakub Michaliszyn
grade
Preferred source (of 2)‎

Average Stack Cost of Büchi Pushdown Automata

Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany
2018 | Journal article
DOI: 10.4230/LIPICS.FSTTCS.2017.42
Source: Self-asserted source
Jakub Michaliszyn
grade
Preferred source (of 2)‎

Elementary Multimodal Logics

CoRR
2018 | Journal article
URI:

http://arxiv.org/abs/1809.03254
Source: Self-asserted source
Jakub Michaliszyn

Non-deterministic Weighted Automata on Random Words

Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany
2018 | Journal article
DOI: 10.4230/LIPICS.CONCUR.2018.10
Source: Self-asserted source
Jakub Michaliszyn
grade
Preferred source (of 2)‎

Querying Best Paths in Graph Databases

Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany
2018 | Journal article
DOI: 10.4230/LIPICS.FSTTCS.2017.43
Source: Self-asserted source
Jakub Michaliszyn
grade
Preferred source (of 2)‎

Satisfiability versus Finite Satisfiability in Elementary Modal Logics

Fundamenta Informaticae
2018-11-03 | Journal article
DOI: 10.3233/FI-2018-1736
Source: Self-asserted source
Jakub Michaliszyn
grade
Preferred source (of 2)‎

Average Stack Cost of Buechi Pushdown Automata

CoRR
2017 | Journal article
URI:

http://arxiv.org/abs/1710.04490
Source: Self-asserted source
Jakub Michaliszyn

Querying Best Paths in Graph Databases

CoRR
2017 | Journal article
URI:

http://arxiv.org/abs/1710.04419
Source: Self-asserted source
Jakub Michaliszyn

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

Frontiers in Artificial Intelligence and Applications
2016 | Journal article
DOI: 10.3233/978-1-61499-672-9-286
Source: Self-asserted source
Jakub Michaliszyn

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

Principles of Knowledge Representation and Reasoning: Proceedings of the Fifteenth International Conference, KR 2016, Cape Town, South Africa, April 25-29, 2016
2016 | Conference paper
URI:

http://www.aaai.org/ocs/index.php/KR/KR16/paper/view/12823
Source: Self-asserted source
Jakub Michaliszyn

Querying Data Graphs with Arithmetical Regular Expressions

Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI 2016, New York, NY, USA, 9-15 July 2016
2016 | Conference paper
URI:

http://www.ijcai.org/Abstract/16/158
Source: Self-asserted source
Jakub Michaliszyn

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

Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, Singapore, May 9-13, 2016
2016 | Conference paper
URI:

http://dl.acm.org/citation.cfm?id=2937022
Source: Self-asserted source
Jakub Michaliszyn

Model Checking Epistemic Halpern-Shoham Logic Extended with Regular Expressions

CoRR
2015 | Journal article
URI:

http://arxiv.org/abs/1509.00608
Source: Self-asserted source
Jakub Michaliszyn

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

Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2015, Istanbul, Turkey, May 4-8, 2015
2015 | Conference paper
URI:

http://dl.acm.org/citation.cfm?id=2772907
Source: Self-asserted source
Jakub Michaliszyn

On the Decidability of Elementary Modal Logics

ACM Transactions on Computational Logic
2015-09-23 | Journal article
DOI: 10.1145/2817825
Part of ISSN: 1529-3785
Source: Self-asserted source
Jakub Michaliszyn

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

Principles of Knowledge Representation and Reasoning: Proceedings of the Fourteenth International Conference, KR 2014, Vienna, Austria, July 20-24, 2014
2014 | Conference paper
URI:

http://www.aaai.org/ocs/index.php/KR/KR14/paper/view/8003
Source: Self-asserted source
Jakub Michaliszyn

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

ECAI 2014 - 21st European Conference on Artificial Intelligence, 18-22 August 2014, Prague, Czech Republic - Including Prestigious Applications of Intelligent Systems (PAIS 2014)
2014 | Conference paper
DOI: 10.3233/978-1-61499-419-0-543
Source: Self-asserted source
Jakub Michaliszyn

Model Checking Unbounded Artifact-Centric Systems

Principles of Knowledge Representation and Reasoning: Proceedings of the Fourteenth International Conference, KR 2014, Vienna, Austria, July 20-24, 2014
2014 | Conference paper
URI:

http://www.aaai.org/ocs/index.php/KR/KR14/paper/view/7992
Source: Self-asserted source
Jakub Michaliszyn

The Undecidability of the Logic of Subintervals

Fundamenta Informaticae
2014 | Journal article
DOI: 10.3233/FI-2014-1011
Source: Self-asserted source
Jakub Michaliszyn

Two-Variable First-Order Logic with Equivalence Closure

SIAM Journal on Computing
2014-01 | Journal article
DOI: 10.1137/120900095
Part of ISSN: 0097-5397
Part of ISSN: 1095-7111
Source: Self-asserted source
Jakub Michaliszyn

Elementary Modal Logics over Transitive Structures

Computer Science Logic 2013 (CSL 2013), CSL 2013, September 2-5, 2013, Torino, Italy
2013 | Conference paper
DOI: 10.4230/LIPIcs.CSL.2013.563
Source: Self-asserted source
Jakub Michaliszyn
How many people are using ORCID?