default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTeofil Sidoruk
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j4]Jaime Arias
, Carlos Olarte, Laure Petrucci, Lukasz Masko, Wojciech Penczek, Teofil Sidoruk:
Optimal Scheduling of Agents in ADTrees: Specialized Algorithm and Declarative Models. IEEE Trans. Reliab. 73(2): 861-875 (2024)- [c11]Jaime Arias, Carlos Olarte, Wojciech Penczek, Laure Petrucci, Teofil Sidoruk:
Model Checking and Synthesis for Strategic Timed CTL using Strategies in Rewriting Logic. PPDP 2024: 10:1-10:14 - 2023
- [c10]Jaime Arias, Wojciech Jamroga, Wojciech Penczek, Laure Petrucci, Teofil Sidoruk:
Strategic (Timed) Computation Tree Logic. AAMAS 2023: 382-390 - [c9]Damian Kurpiewski, Wojciech Jamroga, Teofil Sidoruk:
Towards Modelling and Verification of Social Explainable AI. ICAART (1) 2023: 396-403 - [i6]Damian Kurpiewski, Wojciech Jamroga, Teofil Sidoruk:
Towards Modelling and Verification of Social Explainable AI. CoRR abs/2302.01063 (2023) - [i5]Jaime Arias, Wojciech Jamroga, Wojciech Penczek, Laure Petrucci, Teofil Sidoruk:
Strategic (Timed) Computation Tree Logic. CoRR abs/2302.13405 (2023) - [i4]Jaime Arias, Carlos Olarte, Laure Petrucci, Lukasz Masko, Wojciech Penczek, Teofil Sidoruk:
Optimal Scheduling of Agents in ADTrees: Specialised Algorithm and Declarative Models. CoRR abs/2305.04616 (2023) - [i3]Damian Kurpiewski, Wojciech Jamroga, Lukasz Masko, Lukasz Mikulski, Witold Pazderski, Wojciech Penczek, Teofil Sidoruk:
Verification of Multi-Agent Properties in Electronic Voting: A Case Study. CoRR abs/2310.15789 (2023) - 2022
- [c8]Wojtek Jamroga, Lukasz Masko, Lukasz Mikulski, Witold Pazderski, Wojciech Penczek, Teofil Sidoruk, Damian Kurpiewski:
Verification of Multi-Agent Properties in Electronic Voting: A Case Study. AiML 2022: 531-556 - [c7]Jaime Arias, Laure Petrucci, Lukasz Masko, Wojciech Penczek, Teofil Sidoruk:
Minimal Schedule with Minimal Number of Agents in Attack-Defence Trees. ICECCS 2022: 1-10 - 2021
- [c6]Wojciech Jamroga, Wojciech Penczek, Teofil Sidoruk:
Strategic Abilities of Asynchronous Agents: Semantic Side Effects. AAMAS 2021: 1545-1547 - [c5]Jaime Arias, Wojciech Penczek, Laure Petrucci, Teofil Sidoruk:
ADT2AMAS: Managing Agents in Attack-Defence Scenarios. AAMAS 2021: 1749-1751 - [c4]Wojciech Jamroga, Wojciech Penczek, Teofil Sidoruk:
Strategic Abilities of Asynchronous Agents: Semantic Side Effects and How to Tame Them. KR 2021: 368-378 - [i2]Jaime Arias, Wojciech Penczek, Laure Petrucci, Teofil Sidoruk:
Minimal Schedule with Minimal Number of Agents in Attack-Defence Trees. CoRR abs/2101.06838 (2021) - 2020
- [j3]Wojciech Jamroga, Wojciech Penczek, Teofil Sidoruk, Piotr Dembinski, Antoni W. Mazurkiewicz:
Towards Partial Order Reductions for Strategic Ability. J. Artif. Intell. Res. 68: 817-850 (2020) - [c3]Jaime Arias, Carlos E. Budde, Wojciech Penczek, Laure Petrucci, Teofil Sidoruk, Mariëlle Stoelinga:
Hackers vs. Security: Attack-Defence Trees as Asynchronous Multi-agent Systems. ICFEM 2020: 3-19 - [i1]Wojciech Jamroga, Wojciech Penczek, Teofil Sidoruk:
Strategic Abilities of Asynchronous Agents: Semantic Paradoxes and How to Tame Them. CoRR abs/2003.03867 (2020)
2010 – 2019
- 2019
- [j2]Artur Niewiadomski, Piotr Switalski, Teofil Sidoruk, Wojciech Penczek:
Applying Modern SAT-solvers to Solving Hard Problems. Fundam. Informaticae 165(3-4): 321-344 (2019) - [c2]Laure Petrucci, Michal Knapik, Wojciech Penczek, Teofil Sidoruk:
Squeezing State Spaces of (Attack-Defence) Trees. ICECCS 2019: 71-80 - 2018
- [j1]Artur Niewiadomski, Piotr Switalski, Teofil Sidoruk, Wojciech Penczek:
SMT-Solvers in Action: Encoding and Solving Selected Problems in NP and EXPTIME. Sci. Ann. Comput. Sci. 28(2): 269-288 (2018) - [c1]Teofil Sidoruk:
Investigating Characteristics and Differences Between Easy and Hard SAT Instances. CS&P 2018
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-10-23 21:25 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:
