default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJakub Michaliszyn
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i12]Jakub Michaliszyn, Jan Otop:
Deterministic Weighted Automata under Partial Observability. CoRR abs/2403.00390 (2024)- 2023
- [c30]Jakub Michaliszyn, Jan Otop
, Piotr Wieczorek:
Reachability and Bounded Emptiness Problems of Constraint Automata with Prefix, Suffix and Infix. CONCUR 2023: 3:1-3:16 - [c29]Jakub Michaliszyn, Jan Otop:
Deterministic Weighted Automata Under Partial Observability. JELIA 2023: 771-784 - 2022
- [j7]Jakub Michaliszyn, Jan Otop:
Learning infinite-word automata with loop-index queries. Artif. Intell. 307: 103710 (2022) - [c28]Jakub Michaliszyn, Jan Otop:
Learning Deterministic Visibly Pushdown Automata Under Accessible Stack. MFCS 2022: 74:1-74:16 - 2021
- [j6]Jakub Michaliszyn, Jan Otop, Piotr Wieczorek:
Modular Path Queries with Arithmetic. Log. Methods Comput. Sci. 17(3) (2021) - [c27]Bartosz Bednarczyk, Jakub Michaliszyn:
"Most of" leads to undecidability: Failure of adding frequencies to LTL. FoSSaCS 2021: 82-101 - [c26]Jakub Michaliszyn, Jan Otop:
Minimization of Limit-Average Automata. IJCAI 2021: 2819-2825 - 2020
- [j5]Jakub Michaliszyn, Jan Otop:
Non-deterministic weighted automata evaluated over Markov chains. J. Comput. Syst. Sci. 108: 118-136 (2020) - [c25]Jakub Michaliszyn, Jan Otop:
Learning Deterministic Automata on Infinite Words. ECAI 2020: 2370-2377 - [i11]Jakub Michaliszyn, Jan Otop, Piotr Wieczorek:
Modular Path Queries with Arithmetic. CoRR abs/2002.04460 (2020) - [i10]Bartosz Bednarczyk, Jakub Michaliszyn:
"Most of" leads to undecidability: Failure of adding frequencies to LTL. CoRR abs/2007.01233 (2020)
2010 – 2019
- 2019
- [c24]Jakub Michaliszyn, Jan Otop:
Approximate Learning of Limit-Average Automata. CONCUR 2019: 17:1-17:16 - [c23]Jakub Michaliszyn, Piotr Witkowski:
Decidability of Model Checking Multi-Agent Systems with Regular Expressions against Epistemic HS Specifications. IJCAI 2019: 4746-4752 - [i9]Jakub Michaliszyn, Jan Otop:
Approximate Learning of Limit-Average Automata. CoRR abs/1906.11104 (2019) - [i8]Jakub Michaliszyn, Jan Otop:
Non-deterministic weighted automata evaluated over Markov chains. CoRR abs/1908.04625 (2019) - 2018
- [j4]Jakub Michaliszyn, Jan Otop, Piotr Witkowski:
Satisfiability versus Finite Satisfiability in Elementary Modal Logics. Fundam. Informaticae 163(2): 165-188 (2018) - [c22]Jakub Michaliszyn, Jan Otop:
Non-deterministic Weighted Automata on Random Words. CONCUR 2018: 10:1-10:16 - [i7]Jakub Michaliszyn:
Elementary Multimodal Logics. CoRR abs/1809.03254 (2018) - 2017
- [c21]Jakub Michaliszyn, Jan Otop:
Average Stack Cost of Büchi Pushdown Automata. FSTTCS 2017: 42:1-42:13 - [c20]Jakub Michaliszyn, Jan Otop, Piotr Wieczorek:
Querying Best Paths in Graph Databases. FSTTCS 2017: 43:1-43:15 - [i6]Jakub Michaliszyn, Jan Otop, Piotr Wieczorek:
Querying Best Paths in Graph Databases. CoRR abs/1710.04419 (2017) - [i5]Jakub Michaliszyn, Jan Otop:
Average Stack Cost of Buechi Pushdown Automata. CoRR abs/1710.04490 (2017) - 2016
- [c19]Alessio Lomuscio, Jakub Michaliszyn:
Verification of Multi-Agent Systems via Predicate Abstraction against ATLK Specifications. AAMAS 2016: 662-670 - [c18]Francesco Belardinelli, Alessio Lomuscio, Jakub Michaliszyn:
Agent-Based Refinement for Predicate Abstraction of Multi-Agent Systems. ECAI 2016: 286-294 - [c17]Maciej Grabon, Jakub Michaliszyn, Jan Otop, Piotr Wieczorek:
Querying Data Graphs with Arithmetical Regular Expressions. IJCAI 2016: 1088-1094 - [c16]Alessio Lomuscio, Jakub Michaliszyn:
Model Checking Multi-Agent Systems against Epistemic HS Specifications with Regular Expressions. KR 2016: 298-308 - 2015
- [j3]Jakub Michaliszyn, Jan Otop, Emanuel Kieronski:
On the Decidability of Elementary Modal Logics. ACM Trans. Comput. Log. 17(1): 2 (2015) - [c15]Alessio Lomuscio, Jakub Michaliszyn:
Verifying Multi-Agent Systems by Model Checking Three-valued Abstractions. AAMAS 2015: 189-198 - [i4]Alessio Lomuscio, Jakub Michaliszyn:
Model Checking Epistemic Halpern-Shoham Logic Extended with Regular Expressions. CoRR abs/1509.00608 (2015) - 2014
- [j2]Jerzy Marcinkowski, Jakub Michaliszyn:
The Undecidability of the Logic of Subintervals. Fundam. Informaticae 131(2): 217-240 (2014) - [j1]Emanuel Kieronski, Jakub Michaliszyn, Ian Pratt-Hartmann, Lidia Tendera:
Two-Variable First-Order Logic with Equivalence Closure. SIAM J. Comput. 43(3): 1012-1063 (2014) - [c14]Alessio R. Lomuscio, Jakub Michaliszyn:
Decidability of model checking multi-agent systems against a class of EHS specifications. ECAI 2014: 543-548 - [c13]Alessio Lomuscio, Jakub Michaliszyn:
An Abstraction Technique for the Verification of Multi-Agent Systems Against ATL Specifications. KR 2014 - [c12]Alessio Lomuscio, Jakub Michaliszyn:
Model Checking Unbounded Artifact-Centric Systems. KR 2014 - 2013
- [c11]Jakub Michaliszyn, Jan Otop:
Elementary Modal Logics over Transitive Structures. CSL 2013: 563-577 - [c10]Alessio Lomuscio, Jakub Michaliszyn:
An Epistemic Halpern-Shoham Logic. IJCAI 2013: 1010-1016 - 2012
- [c9]Jakub Michaliszyn, Emanuel Kieronski:
Finite Satisfiability of Modal Logic over Horn~Definable Classes of Frames. Advances in Modal Logic 2012: 464-482 - [c8]Emanuel Kieronski, Jakub Michaliszyn:
Two-Variable Universal Logic with Transitive Closure. CSL 2012: 396-410 - [c7]Emanuel Kieronski, Jakub Michaliszyn, Ian Pratt-Hartmann, Lidia Tendera:
Two-Variable First-Order Logic with Equivalence Closure. LICS 2012: 431-440 - [c6]Jakub Michaliszyn, Jan Otop:
Decidable Elementary Modal Logics. LICS 2012: 491-500 - [c5]Jakub Michaliszyn, Jan Otop, Piotr Witkowski:
Satisfiability vs. Finite Satisfiability in Elementary Modal Logics. GandALF 2012: 141-154 - [i3]Jakub Michaliszyn, Anca Muscholl, Slawek Staworko, Piotr Wieczorek, Zhilin Wu:
On Injective Embeddings of Tree Patterns. CoRR abs/1204.4948 (2012) - 2011
- [c4]Emanuel Kieronski, Jakub Michaliszyn, Jan Otop:
Modal Logics Definable by Universal Three-Variable Formulas. FSTTCS 2011: 264-275 - [c3]Jerzy Marcinkowski, Jakub Michaliszyn:
The Ultimate Undecidability Result for the Halpern-Shoham Logic. LICS 2011: 377-386 - 2010
- [c2]Jerzy Marcinkowski, Jakub Michaliszyn, Emanuel Kieronski:
B and D Are Enough to Make the Halpern-Shoham Logic Undecidable. ICALP (2) 2010: 357-368 - [i2]Jerzy Marcinkowski, Jakub Michaliszyn:
The Last Paper on the Halpern-Shoham Interval Temporal Logic. CoRR abs/1010.4529 (2010)
2000 – 2009
- 2009
- [c1]Jakub Michaliszyn:
Decidability of the Guarded Fragment with the Transitive Closure. ICALP (2) 2009: 261-272 - [i1]Jerzy Marcinkowski, Jakub Michaliszyn:
The cost of being co-Buchi is nonlinear. CoRR abs/0906.0072 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
