Obserwuj
Teofil Sidoruk
Teofil Sidoruk
Assistant, Institute of Computer Science, Polish Academy of Sciences
Zweryfikowany adres z ipipan.waw.pl
Tytuł
Cytowane przez
Cytowane przez
Rok
Towards partial order reductions for strategic ability
W Jamroga, W Penczek, T Sidoruk, P Dembiński, A Mazurkiewicz
Journal of Artificial Intelligence Research 68, 817-850, 2020
412020
Hackers vs. security: attack-defence trees as asynchronous multi-agent systems
J Arias, CE Budde, W Penczek, L Petrucci, T Sidoruk, M Stoelinga
International Conference on Formal Engineering Methods, 3-19, 2020
122020
Applying modern sat-solvers to solving hard problems
A Niewiadomski, P Switalski, T Sidoruk, W Penczek
Fundamenta Informaticae 165 (3-4), 321-344, 2019
122019
Squeezing state spaces of (attack-defence) trees
L Petrucci, M Knapik, W Penczek, T Sidoruk
2019 24th International Conference on Engineering of Complex Computer …, 2019
82019
Strategic (timed) computation tree logic
J Arias, W Jamroga, W Penczek, L Petrucci, T Sidoruk
arXiv preprint arXiv:2302.13405, 2023
52023
Strategic abilities of asynchronous agents: Semantic side effects and how to tame them
W Jamroga, W Penczek, T Sidoruk
arXiv preprint arXiv:2003.03867, 2020
42020
Verification of Multi-Agent Properties in Electronic Voting: A Case Study
D Kurpiewski, W Jamroga, Ł Maśko, Ł Mikulski, W Pazderski, W Penczek, ...
arXiv preprint arXiv:2310.15789, 2023
32023
Towards modelling and verification of social explainable AI
D Kurpiewski, W Jamroga, T Sidoruk
arXiv preprint arXiv:2302.01063, 2023
32023
Minimal schedule with minimal number of agents in attack-defence trees
J Arias, L Petrucci, Ł Maśko, W Penczek, T Sidoruk
2022 26th International Conference on Engineering of Complex Computer …, 2022
32022
Comparing Efficiency of Modern SAT-solvers for Selected Problems in P, NP, PSPACE, and EXPTIME
A Niewiadomski, W Penczek, T Sidoruk
Proceedings of the 26th International Workshop on Concurrency, Specification …, 2017
32017
Strategic abilities of asynchronous agents: Semantic paradoxes and how to tame them
W Jamroga, W Penczek, T Sidoruk
CoRR abs/2003.03867. Revised version, 2021
22021
ADT2AMAS: Managing agents in attack-defence scenarios
J Arias, W Penczek, L Petrucci, T Sidoruk
AAMAS'21: 20th International Conference on Autonomous Agents and Multiagent …, 2021
22021
Strategic abilities of asynchronous agents: Semantic side effects
W Jamroga, W Penczek, T Sidoruk
Proceedings of AAMAS 2021, 1545-1547, 2021
22021
Squeezing state spaces of (attack-defence) trees
M Knapik, W Penczek, L Petrucci, T Sidoruk
2019 24th International Conference on Engineering of Complex Computer …, 2019
22019
Smt-solvers in action: Encoding and solving selected problems in NP and EXPTIME
A Niewiadomski, P Switalski, T Sidoruk, W Penczek
Scientific Annals of Computer Science 28 (2), 269-288, 2018
22018
Investigating Characteristics and Differences Between Easy and Hard SAT Instances.
T Sidoruk
CS&P, 2018
12018
Optimal Scheduling of Agents in ADTrees: Specialized Algorithm and Declarative Models
J Arias, C Olarte, L Petrucci, Ł Maśko, W Penczek, T Sidoruk
IEEE Transactions on Reliability, 2024
2024
Trust topologies in verification of social explainable AI
W Jamroga, D Kurpiewski, Ł Mikulski, T Sidoruk
Episciences. org
H IRISA
2022 26th International Conference on Engineering of Complex Computer Systems (ICECCS)| 978-1-6654-0162-3/22/$31.00© 2022 IEEE| DOI: 10.1109/ICECCS54210. 2022.00033
M Afendi, Y Aït-Ameur, J Arias, R Banach, Y Bao, M Basso, N Belloir, ...
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20