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:

Learning General Optimal Policies with Graph Neural Networks: Expressive Power, Transparency, and Limits
Simon Ståhlberg, Blai Bonet, Héctor Geffner
Proceedings of the International Conference on Automated Planning and Scheduling (2022) Vol. 32, pp. 629-637
Open Access | Times Cited: 19

Showing 19 citing articles:

Learning Generalized Policies without Supervision Using GNNs
Simon Ståhlberg, Blai Bonet, Héctor Geffner
(2022), pp. 474-483
Open Access | Times Cited: 13
Learning General Policies with Policy Gradient Methods
Simon Ståhlberg, Blai Bonet, Héctor Geffner
(2023), pp. 647-657
Open Access | Times Cited: 7
Learning General Policies for Planning through GPT Models
Nicholas Rossetti, Massimiliano Tummolo, Alfonso Gerevini, et al.
Proceedings of the International Conference on Automated Planning and Scheduling (2024) Vol. 34, pp. 500-508
Open Access | Times Cited: 2
Learning Domain-Independent Heuristics for Grounded and Lifted Planning
Dillon Chen, Sylvie Thiébaux, Felipe Trevizan
Proceedings of the AAAI Conference on Artificial Intelligence (2024) Vol. 38, Iss. 18, pp. 20078-20086
Open Access | Times Cited: 1
Return to Tradition: Learning Reliable Heuristics with Classical Machine Learning
Dillon Chen, Felipe Trevizan, Sylvie Thiébaux
Proceedings of the International Conference on Automated Planning and Scheduling (2024) Vol. 34, pp. 68-76
Open Access | Times Cited: 1
Expressiveness of Graph Neural Networks in Planning Domains
Rostislav Horčı́k, Gustav Šír
Proceedings of the International Conference on Automated Planning and Scheduling (2024) Vol. 34, pp. 281-289
Open Access | Times Cited: 1
Neural Policy Safety Verification via Predicate Abstraction: CEGAR
Marcel Vinzent, Siddhant Sharma, Jöerg Hoffmann
Proceedings of the AAAI Conference on Artificial Intelligence (2023) Vol. 37, Iss. 12, pp. 15188-15196
Open Access | Times Cited: 3
Automatic Metamorphic Test Oracles for Action-Policy Testing
Jan Eisenhut, Álvaro Torralba, Maria Christakis, et al.
Proceedings of the International Conference on Automated Planning and Scheduling (2023) Vol. 33, Iss. 1, pp. 109-117
Open Access | Times Cited: 2
Lifted Successor Generation by Maximum Clique Enumeration
Simon Ståhlberg
Frontiers in artificial intelligence and applications (2023)
Open Access | Times Cited: 2
New Fuzzing Biases for Action Policy Testing
Jan Eisenhut, Xandra Schuler, Daniel Fišer, et al.
Proceedings of the International Conference on Automated Planning and Scheduling (2024) Vol. 34, pp. 162-167
Open Access
Learning Generalised Policies for Numeric Planning
Ryan Xiao Wang, Sylvie Thiébaux
Proceedings of the International Conference on Automated Planning and Scheduling (2024) Vol. 34, pp. 633-642
Open Access
Neural Action Policy Safety Verification: Applicablity Filtering
Marcel Vinzent, Jörg Hoffmann
Proceedings of the International Conference on Automated Planning and Scheduling (2024) Vol. 34, pp. 607-612
Open Access
On Policy Reuse: An Expressive Language for Representing and Executing General Policies that Call Other Policies
Blai Bonet, Dominik Drexler, Héctor Geffner
Proceedings of the International Conference on Automated Planning and Scheduling (2024) Vol. 34, pp. 31-39
Open Access
Understanding Sample Generation Strategies for Learning Heuristic Functions in Classical Planning
Rafael V. Bettker, Pedro P. Minini, André G. Pereira, et al.
Journal of Artificial Intelligence Research (2024) Vol. 80, pp. 243-271
Open Access
Safety Verification of Tree-Ensemble Policies via Predicate Abstraction
Chaahat Jain, Lorenzo Cascioli, Laurens Devos, et al.
Frontiers in artificial intelligence and applications (2024)
Open Access
Integrating Classical Planners with GPT-Based Planning Policies
Massimiliano Tummolo, Nicholas Rossetti, Alfonso Gerevini, et al.
Lecture notes in computer science (2024), pp. 315-329
Closed Access
Target Languages (vs. Inductive Biases) for Learning to Act and Plan
Héctor Geffner
Proceedings of the AAAI Conference on Artificial Intelligence (2022) Vol. 36, Iss. 11, pp. 12326-12333
Open Access | Times Cited: 1
Analysis of Learning Heuristic Estimates for Grid Planning with Cellular Simultaneous Recurrent Networks
Michaela Urbanovská, Antonín Komenda
SN Computer Science (2023) Vol. 4, Iss. 6
Closed Access
Understanding Sample Generation Strategies for Learning Heuristic Functions in Classical Planning
Rafael V. Bettker, Pedro P. Minini, A. G. Pereira, et al.
arXiv (Cornell University) (2022)
Open Access
Page 1

Scroll to top