Investigating Characteristics and Differences Between Easy and Hard SAT Instances. - Teofil Sidoruk (CS&P, 2018)

SMT-Solvers in Action: Encoding and Solving Selected Problems in NP and EXPTIME. - Artur Niewiadomski 001; Piotr Switalski; Teofil Sidoruk; Wojciech Penczek (Sci. Ann. Comput. Sci., 2018)

Squeezing State Spaces of (Attack-Defence) Trees. - Laure Petrucci; Michal Knapik; Wojciech Penczek; Teofil Sidoruk (ICECCS, 2019)

Applying Modern SAT-solvers to Solving Hard Problems. - Artur Niewiadomski 001; Piotr Switalski; Teofil Sidoruk; Wojciech Penczek (Fundam. Informaticae, 2019)

Hackers vs. Security: Attack-Defence Trees as Asynchronous Multi-agent Systems. - Jaime Arias 001; Carlos E. Budde; Wojciech Penczek; Laure Petrucci; Teofil Sidoruk; Mariëlle Stoelinga (ICFEM, 2020)

Strategic Abilities of Asynchronous Agents: Semantic Paradoxes and How to Tame Them. - Wojciech Jamroga; Wojciech Penczek; Teofil Sidoruk (CoRR, 2020)

Towards Partial Order Reductions for Strategic Ability. - Wojciech Jamroga; Wojciech Penczek; Teofil Sidoruk; Piotr Dembinski; Antoni W. Mazurkiewicz (J. Artif. Intell. Res., 2020)

ADT2AMAS: Managing Agents in Attack-Defence Scenarios. - Jaime Arias 001; Wojciech Penczek; Laure Petrucci; Teofil Sidoruk (AAMAS, 2021)

Strategic Abilities of Asynchronous Agents: Semantic Side Effects. - Wojciech Jamroga; Wojciech Penczek; Teofil Sidoruk (AAMAS, 2021)

Strategic Abilities of Asynchronous Agents: Semantic Side Effects and How to Tame Them. - Wojciech Jamroga; Wojciech Penczek; Teofil Sidoruk (KR, 2021)

Minimal Schedule with Minimal Number of Agents in Attack-Defence Trees. - Jaime Arias 001; Wojciech Penczek; Laure Petrucci; Teofil Sidoruk (CoRR, 2021)

Verification of Multi-Agent Properties in Electronic Voting: A Case Study. - Wojtek Jamroga; Lukasz Masko; Lukasz Mikulski; Witold Pazderski; Wojciech Penczek; Teofil Sidoruk; Damian Kurpiewski (AiML, 2022)

Minimal Schedule with Minimal Number of Agents in Attack-Defence Trees. - Jaime Arias 001; Laure Petrucci; Lukasz Masko; Wojciech Penczek; Teofil Sidoruk (ICECCS, 2022)

Strategic (Timed) Computation Tree Logic. - Jaime Arias 001; Wojciech Jamroga; Wojciech Penczek; Laure Petrucci; Teofil Sidoruk (AAMAS, 2023)

Towards Modelling and Verification of Social Explainable AI. - Damian Kurpiewski; Wojciech Jamroga; Teofil Sidoruk (ICAART (1), 2023)

Optimal Scheduling of Agents in ADTrees: Specialised Algorithm and Declarative Models. - Jaime Arias 001; Carlos Olarte; Laure Petrucci; Lukasz Masko; Wojciech Penczek; Teofil Sidoruk (CoRR, 2023)

Model Checking and Synthesis for Strategic Timed CTL using Strategies in Rewriting Logic. - Jaime Arias 001; Carlos Olarte; Wojciech Penczek; Laure Petrucci; Teofil Sidoruk (PPDP, 2024)

Asynchronous Agents with Perfect Recall: Model Reductions, Knowledge-Based Construction, and Model Checking for Coalitional Strategies. - Dilian Gurov; Filip Jamroga; Wojciech Jamroga; Mateusz Kaminski; Damian Kurpiewski; Wojciech Penczek; Teofil Sidoruk (CoRR, 2024)

Optimal Scheduling of Agents in ADTrees: Specialized Algorithm and Declarative Models. - Jaime Arias 001; Carlos Olarte; Laure Petrucci; Lukasz Masko; Wojciech Penczek; Teofil Sidoruk (IEEE Trans. Reliab., 2024)

Satisfiability Checking for (Strategic) Timed CTL Using IMITATOR. - Wojciech Penczek; Laure Petrucci; Teofil Sidoruk (ICAART (1), 2025)

Probabilistic Timed ATL. - Wojciech Jamroga; Marta Kwiatkowska; Wojciech Penczek; Laure Petrucci; Teofil Sidoruk (AAMAS, 2025)