Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Michaliszyn, Jakub
35  Ergebnisse:
Personensuche X
?
1

Deterministic Weighted Automata Under Partial Observability:

, In: Logics in Artificial Intelligence; Lecture Notes in Computer Science,
Michaliszyn, Jakub ; Otop, Jan - p. 771-784 , 2023
Link: https://doi.org/10.1007/..
 
?
2

Learning infinite-word automata with loop-index queries:

Michaliszyn, Jakub ; Otop, Jan
Artificial Intelligence.  307 (2022)  - p. 103710 , 2022
Link: https://doi.org/10.1016/..
 
?
3

Modular Path Queries with Arithmetic:

Michaliszyn, Jakub ; Otop, Jan ; Wieczorek, Piotr
Logical Methods in Computer Science.  17, Issue 3 (2021)  - p. , 2021
Link: https://doi.org/10.46298..
 
?
4

"Most of" leads to undecidability: Failure of adding freque..:

, In: Lecture Notes in Computer Science; Foundations of Software Science and Computation Structures,
Bednarczyk, Bartosz ; Michaliszyn, Jakub - p. 82-101 , 2021
Link: https://doi.org/10.1007/..
 
?
5

Non-deterministic weighted automata evaluated over Markov c..:

Michaliszyn, Jakub ; Otop, Jan
Journal of Computer and System Sciences.  108 (2020)  - p. 118-136 , 2020
Link: https://doi.org/10.1016/..
 
?
6

On the Decidability of Elementary Modal Logics:

Michaliszyn, Jakub ; Otop, Jan ; Kieroński, Emanuel
ACM Transactions on Computational Logic.  17 (2015)  1 - p. 1-47 , 2015
Link: https://doi.org/10.1145/..
 
?
7

Verifying Multi-Agent Systems by Model Checking Three-value..:

, In: Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems,
Lomuscio, Alessio ; Michaliszyn, Jakub - p. 189-198 , 2015
Link: https://dl.acm.org/doi/1..
 
?
8

On the Decidability of Elementary Modal Logics:

Michaliszyn, Jakub ; Otop, Jan ; Kieroński, Emanuel
ACM Transactions on Computational Logic (TOCL).  17 (2015)  1 - p. 1-47 , 2015
Link: https://dl.acm.org/doi/1..
 
?
9

Two-Variable First-Order Logic with Equivalence Closure:

Kieroński, Emanuel ; Michaliszyn, Jakub ; Pratt-Hartmann, Ian.
SIAM Journal on Computing.  43 (2014)  3 - p. 1012-1063 , 2014
Link: https://doi.org/10.1137/..
 
?
10

Two-Variable First-Order Logic with Equivalence Closure:

, In: Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science,
Kieronski, Emanuel ; Michaliszyn, Jakub ; Pratt-Hartmann, Ian. - p. 431-440 , 2012
Link: https://dl.acm.org/doi/1..
 
?
11

Decidable Elementary Modal Logics:

, In: Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science,
Michaliszyn, Jakub ; Otop, Jan - p. 491-500 , 2012
Link: https://dl.acm.org/doi/1..
 
?
12

Reachability and Bounded Emptiness Problems of Constraint A..:

Michaliszyn, Jakub ; Otop, Jan ; Wieczorek, Piotr
doi:10.4230/LIPIcs.CONCUR.2023.3.  , 2023
Link: https://doi.org/10.4230/..
 
?
13

Learning Deterministic Visibly Pushdown Automata Under Acce..:

Michaliszyn, Jakub ; Otop, Jan
doi:10.4230/LIPIcs.MFCS.2022.74.  , 2022
Link: https://doi.org/10.4230/..
 
?
14

"Most of" leads to undecidability: Failure of adding freque..:

Bednarczyk, Bartosz ; Michaliszyn, Jakub
http://www.ncbi.nlm.nih.gov/pmc/articles/PMC7984134/.  , 2021
Link: http://www.ncbi.nlm.nih...
 
?
15

Modular Path Queries with Arithmetic:

Michaliszyn, Jakub ; Otop, Jan ; Wieczorek, Piotr
http://arxiv.org/abs/2002.04460.  , 2020
Link: http://arxiv.org/abs/200..
 
1-15