Teofil Sidoruk

Orcid: 0000-0002-4393-3447

According to our database1, Teofil Sidoruk authored at least 16 papers between 2018 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Optimal Scheduling of Agents in ADTrees: Specialised Algorithm and Declarative Models.
CoRR, 2023

Towards Modelling and Verification of Social Explainable AI.
Proceedings of the 15th International Conference on Agents and Artificial Intelligence, 2023

Strategic (Timed) Computation Tree Logic.
Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

2022
Minimal Schedule with Minimal Number of Agents in Attack-Defence Trees.
Proceedings of the 26th International Conference on Engineering of Complex Computer Systems, 2022

Verification of Multi-Agent Properties in Electronic Voting: A Case Study.
Proceedings of the Advances in Modal Logic, AiML 2022, Rennes, France, 2022

2021
Minimal Schedule with Minimal Number of Agents in Attack-Defence Trees.
CoRR, 2021

Strategic Abilities of Asynchronous Agents: Semantic Side Effects and How to Tame Them.
Proceedings of the 18th International Conference on Principles of Knowledge Representation and Reasoning, 2021

Strategic Abilities of Asynchronous Agents: Semantic Side Effects.
Proceedings of the AAMAS '21: 20th International Conference on Autonomous Agents and Multiagent Systems, 2021

ADT2AMAS: Managing Agents in Attack-Defence Scenarios.
Proceedings of the AAMAS '21: 20th International Conference on Autonomous Agents and Multiagent Systems, 2021

2020
Towards Partial Order Reductions for Strategic Ability.
J. Artif. Intell. Res., 2020

Strategic Abilities of Asynchronous Agents: Semantic Paradoxes and How to Tame Them.
CoRR, 2020

Hackers vs. Security: Attack-Defence Trees as Asynchronous Multi-agent Systems.
Proceedings of the Formal Methods and Software Engineering, 2020

2019
Applying Modern SAT-solvers to Solving Hard Problems.
Fundam. Informaticae, 2019

Squeezing State Spaces of (Attack-Defence) Trees.
Proceedings of the 24th International Conference on Engineering of Complex Computer Systems, 2019

2018
SMT-Solvers in Action: Encoding and Solving Selected Problems in NP and EXPTIME.
Sci. Ann. Comput. Sci., 2018

Investigating Characteristics and Differences Between Easy and Hard SAT Instances.
Proceedings of the 27th International Workshop on Concurrency, 2018


  Loading...