Open Access Helper

OpenAlex Citation Counts

OpenAlex Citations Logo

OpenAlex is a bibliographic catalogue of scientific papers, authors and institutions accessible in open access mode, named after the Library of Alexandria. It's citation coverage is excellent and I hope you will find utility in this listing of citing articles!

If you click the article title, you'll navigate to the article, as listed in CrossRef. If you click the Open Access links, you'll navigate to the "best Open Access location". Clicking the citation count will open this listing for that article. Lastly at the bottom of the page, you'll find basic pagination options.

Requested Article:

Hybrid Compositional Reasoning for Reactive Synthesis from Finite-Horizon Specifications
Suguman Bansal, Yong Li, Lucas M. Tabajara, et al.
Proceedings of the AAAI Conference on Artificial Intelligence (2020) Vol. 34, Iss. 06, pp. 9766-9774
Open Access | Times Cited: 29

Showing 1-25 of 29 citing articles:

Compositional Approach to Translate LTLf/LDLf into Deterministic Finite Automata
Giuseppe De Giacomo, Marco Favorito
Proceedings of the International Conference on Automated Planning and Scheduling (2021) Vol. 31, pp. 122-130
Open Access | Times Cited: 35
Symbolic ltl$$_f$$ Synthesis: A Unified Approach for Synthesizing Winning, Dominant, and Best-Effort Strategies
Giuseppe De Giacomo, Gianmarco Parretti, Shufang Zhu
SN Computer Science (2025) Vol. 6, Iss. 2
Open Access
Monitoring Constraints and Metaconstraints with Temporal Logics on Finite Traces
Giuseppe De Giacomo, Riccardo De Masellis, Fabrizio Maria Maggi, et al.
ACM Transactions on Software Engineering and Methodology (2022) Vol. 31, Iss. 4, pp. 1-44
Open Access | Times Cited: 17
Compositional Safety LTL Synthesis
Suguman Bansal, Giuseppe De Giacomo, Antonio Di Stasio, et al.
Lecture notes in computer science (2023), pp. 1-19
Closed Access | Times Cited: 8
Acacia-Bonsai: A Modern Implementation of Downset-Based LTL Realizability
Michaël Cadilhac, Guillermo A. Pérez
Lecture notes in computer science (2023), pp. 192-207
Open Access | Times Cited: 4
Grounding LTLf Specifications in Image Sequences
Elena Umili, Roberto Capobianco, Giuseppe De Giacomo
(2023), pp. 668-678
Open Access | Times Cited: 4
LTLf Synthesis as AND-OR Graph Search: Knowledge Compilation at Work
Giuseppe De Giacomo, Marco Favorito, Jianwen Li, et al.
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence (2022), pp. 2591-2598
Open Access | Times Cited: 7
Two-Stage Technique for LTLf Synthesis Under LTL Assumptions
Giuseppe De Giacomo, Antonio Di Stasio, Moshe Y. Vardi, et al.
(2020), pp. 304-314
Open Access | Times Cited: 10
Model Checking Strategies from Synthesis over Finite Traces
Suguman Bansal, Yong Li, Lucas M. Tabajara, et al.
Lecture notes in computer science (2023), pp. 227-247
Closed Access | Times Cited: 3
Finite-Trace and Generalized-Reactivity Specifications in Temporal Synthesis
Giuseppe De Giacomo, Antonio Di Stasio, Lucas M. Tabajara, et al.
(2021), pp. 1852-1858
Open Access | Times Cited: 7
On-the-fly Synthesis for LTL over Finite Traces
Shengping Xiao, Jianwen Li, Shufang Zhu, et al.
Proceedings of the AAAI Conference on Artificial Intelligence (2021) Vol. 35, Iss. 7, pp. 6530-6537
Open Access | Times Cited: 6
On Satisficing in Quantitative Games
Suguman Bansal, Krishnendu Chatterjee, Moshe Y. Vardi
Lecture notes in computer science (2021), pp. 20-37
Open Access | Times Cited: 5
On the Power of Automata Minimization in Reactive Synthesis
Shufang Zhu, Lucas M. Tabajara, Geguang Pu, et al.
arXiv (Cornell University) (2021) Vol. 346, pp. 117-134
Open Access | Times Cited: 5
Runtime Verification on FPGAs with LTLf Specifications
Tommy Tracy, Lucas M. Tabajara, Moshe Y. Vardi, et al.
Formal Methods in Computer-Aided Design (2020), pp. 36-46
Closed Access | Times Cited: 4
Synthesis of Maximally Permissive Strategies for LTLf Specifications
Shufang Zhu, Giuseppe De Giacomo
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence (2022), pp. 2783-2789
Open Access | Times Cited: 3
Mimicking Behaviors in Separated Domains
Giuseppe De Giacomo, Dror Fried, Fabio Patrizi, et al.
Journal of Artificial Intelligence Research (2023) Vol. 77, pp. 1087-1112
Open Access | Times Cited: 1
Foundations of Collaborative $$\textsf{DECLARE}$$
Luca Geatti, Marco Montali, Andrey Rivkin
Lecture notes in business information processing (2023), pp. 55-72
Closed Access | Times Cited: 1
Symbolic $$\textsc {ltl}_f$$ Best-Effort Synthesis
Giuseppe De Giacomo, Gianmarco Parretti, Shufang Zhu
Lecture notes in computer science (2023), pp. 228-243
Closed Access | Times Cited: 1
LTLf Best-Effort Synthesis in Nondeterministic Planning Domains
Giuseppe De Giacomo, Gianmarco Parretti, Shufang Zhu
Frontiers in artificial intelligence and applications (2023)
Open Access | Times Cited: 1
Efficient Reactive Synthesis Using Mode Decomposition
Matías Brizzio, César Sánchez
Lecture notes in computer science (2023), pp. 256-275
Closed Access | Times Cited: 1
Act for Your Duties but Maintain Your Rights
Shufang Zhu, Giuseppe De Giacomo
(2022), pp. 384-393
Open Access | Times Cited: 2
Finite-trace and generalized-reactivity specifications in temporal synthesis
Giuseppe De Giacomo, Antonio Di Stasio, Lucas M. Tabajara, et al.
Formal Methods in System Design (2022) Vol. 61, Iss. 2-3, pp. 139-163
Open Access | Times Cited: 2
Synthesizing Good-Enough Strategies for LTLf Specifications
Yong Li, Andrea Turrini, Moshe Y. Vardi, et al.
(2021), pp. 4144-4151
Open Access | Times Cited: 2
Linear Temporal Logic – From Infinite to Finite Horizon
Lucas M. Tabajara, Moshe Y. Vardi
Lecture notes in computer science (2021), pp. 3-12
Closed Access | Times Cited: 2
Automata-Based Quantitative Reasoning
Suguman Bansal
ACM SIGLOG News (2023) Vol. 10, Iss. 3, pp. 4-19
Closed Access
Page 1 - Next Page

Scroll to top