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:
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
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
Showing 7 citing articles:
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
Suguman Bansal, Yong Li, Lucas M. Tabajara, et al.
Lecture notes in computer science (2023), pp. 227-247
Closed Access | Times Cited: 3
Foundations of Reactive Synthesis for Declarative Process Specifications
Luca Geatti, Marco Montali, Andrey Rivkin
Proceedings of the AAAI Conference on Artificial Intelligence (2024) Vol. 38, Iss. 16, pp. 17416-17425
Open Access
Luca Geatti, Marco Montali, Andrey Rivkin
Proceedings of the AAAI Conference on Artificial Intelligence (2024) Vol. 38, Iss. 16, pp. 17416-17425
Open Access
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
Luca Geatti, Marco Montali, Andrey Rivkin
Lecture notes in business information processing (2023), pp. 55-72
Closed Access | Times Cited: 1
Computing minimal unsatisfiable core for LTL over finite traces
Tong Niu, Shengping Xiao, Xiaoyu Zhang, et al.
Journal of Logic and Computation (2023) Vol. 34, Iss. 7, pp. 1274-1294
Closed Access
Tong Niu, Shengping Xiao, Xiaoyu Zhang, et al.
Journal of Logic and Computation (2023) Vol. 34, Iss. 7, pp. 1274-1294
Closed Access
LTLf Satisfiability Checking via Formula Progression (S)
Tong Niu, Yicong Xu, Shengping Xiao, et al.
Proceedings/Proceedings of the ... International Conference on Software Engineering and Knowledge Engineering (2023) Vol. 2023, pp. 357-362
Open Access
Tong Niu, Yicong Xu, Shengping Xiao, et al.
Proceedings/Proceedings of the ... International Conference on Software Engineering and Knowledge Engineering (2023) Vol. 2023, pp. 357-362
Open Access
Efficient Algorithms for LTL$$_f$$ Synthesis
Marco Favorito
Lecture notes in computer science (2023), pp. 540-546
Closed Access
Marco Favorito
Lecture notes in computer science (2023), pp. 540-546
Closed Access
Strategy Repair in Reachability Games
Pierre Gaillard, Fabio Patrizi, Giuseppe Perelli
Frontiers in artificial intelligence and applications (2023)
Open Access
Pierre Gaillard, Fabio Patrizi, Giuseppe Perelli
Frontiers in artificial intelligence and applications (2023)
Open Access
