Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAntonio Di Stasio 0001
Person information
- affiliation: Iniversity of Oxford, UK
- affiliation (former): Università di Roma "La Sapienza", Rome, Italy
Other persons with the same name
- Antonio Di Stasio 0002 — University of Campania "L. Vanvitelli", Aversa, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[c12]Antonio Di Stasio:
Explicit and Symbolic Approaches for Parity Games (Short Paper). IPS/RiCeRcA/SPIRIT@AI*IA 2022- [c11]Antonio Di Stasio:
LTLf Synthesis Under Environment Specifications. ICTCS 2022: 40-46 - [c10]Suguman Bansal, Giuseppe De Giacomo, Antonio Di Stasio
, Yong Li, Moshe Y. Vardi, Shufang Zhu:
Compositional Safety LTL Synthesis. VSTTE 2022: 1-19 - 2021
- [j1]Antonio Di Stasio, Aniello Murano, Vincenzo Prignano, Loredana Sorrentino:
Improving parity games in practice. Ann. Math. Artif. Intell. 89(5-6): 551-574 (2021) - [c9]Giuseppe De Giacomo, Antonio Di Stasio, Lucas M. Tabajara, Moshe Y. Vardi, Shufang Zhu:
Finite-Trace and Generalized-Reactivity Specifications in Temporal Synthesis. IJCAI 2021: 1852-1858 - [c8]Giuseppe De Giacomo, Antonio Di Stasio, Giuseppe Perelli, Shufang Zhu:
Synthesis with Mandatory Stop Actions. KR 2021: 237-246 - 2020
- [c7]Giuseppe De Giacomo, Antonio Di Stasio, Francesco Fuggitti, Sasha Rubin:
Pure-Past Linear Temporal and Dynamic Logic on Finite Traces. IJCAI 2020: 4959-4965 - [c6]Giuseppe De Giacomo, Antonio Di Stasio, Moshe Y. Vardi, Shufang Zhu:
Two-Stage Technique for LTLf Synthesis Under LTL Assumptions. KR 2020: 304-314
2010 – 2019
- 2019
- [i1]Antonio Di Stasio, Aniello Murano, Giuseppe Perelli, Moshe Y. Vardi:
Solving Parity Games Using An Automata-Based Algorithm. CoRR abs/1910.13765 (2019) - 2018
- [b1]Antonio Di Stasio:
Reasoning about LTL Synthesis over finite and infinite games. University of Naples Federico II, Italy, 2018 - [c5]Antonio Di Stasio, Paolo Domenico Lambiase, Vadim Malvone, Aniello Murano:
Dynamic Escape Game. AAMAS 2018: 1806-1808 - [c4]Antonio Di Stasio, Aniello Murano, Moshe Y. Vardi:
Solving Parity Games: Explicit vs Symbolic. CIAA 2018: 159-172 - 2016
- [c3]Giuseppe De Giacomo, Aniello Murano, Sasha Rubin, Antonio Di Stasio:
Imperfect-Information Games and Generalized Planning. IJCAI 2016: 1037-1043 - [c2]Antonio Di Stasio, Aniello Murano, Giuseppe Perelli, Moshe Y. Vardi:
Solving Parity Games Using an Automata-Based Algorithm. CIAA 2016: 64-76 - 2014
- [c1]Antonio Di Stasio, Aniello Murano, Vincenzo Prignano, Loredana Sorrentino:
Solving Parity Games in Scala. FACS 2014: 145-161
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).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.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 2023-03-22 22:39 CET 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:
